-Decompositions of and Dv UNION P where P is a 2-Regular Subgraph of Dv. - Liqun Pu; Hung-Lin Fu; Hao Shen 008 (Graphs Comb., 2006)

Cycle Decompositions of Kn,n-I. - Jun Ma; Liqun Pu; Hao Shen 008 (SIAM J. Discret. Math., 2006)

Maximal sets of Hamilton cycles in Dn. - Liqun Pu; Hung-Lin Fu; Hao Shen 008 (Discret. Math., 2008)

Cycle Systems in the Complete Bipartite Graph Plus a One-Factor. - Liqun Pu; Hao Shen 008; Jun Ma; San Ling (SIAM J. Discret. Math., 2008)

Maximum Packing of Dt - P and Dt U P with Mendelsohn Triples. - Liqun Pu; Hung-Lin Fu; Hao Shen 008 (Ars Comb., 2009)

Directed 3-cycle decompositions of complete directed graphs with quadratic leaves. - Liqun Pu; Hung-Lin Fu; Hao Shen 008 (Discret. Math., 2009)

Maximum Hexagon Packing of Kv-L Where L is a 2-regular Subgraph. - Liqun Pu; Yanling Chai; Hailin Bu (Ars Comb., 2013)

Weak saturation number for multiple copies of the complete graph with a star removed. - Liqun Pu; Yajuan Cui (Discret. Appl. Math., 2016)

Construction of Quasi-Cyclic LDPC Codes Based on Fundamental Theorem of Arithmetic. - Hai Zhu 001; Liqun Pu; Hengzhou Xu; Bo Zhang 053 (Wirel. Commun. Mob. Comput., 2018)

Weak saturation numbers of K2, t and Kp⋃Kq. - Yajuan Cui; Liqun Pu (AKCE Int. J. Graphs Comb., 2019)