On the size of graphs with all cycle having distinct length. - Chunhui Lai (Discret. Math., 1993)

A note on potentially K4-e graphical sequences. - Chunhui Lai (Australas. J Comb., 2001)

A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length. - Chunhui Lai (Electron. J. Comb., 2001)

Graphs without repeated cycle lengths. - Chunhui Lai (Australas. J Comb., 2003)

An extremal problem on potentially Kp, 1, 1 -graphic sequences. - Chunhui Lai (Discret. Math. Theor. Comput. Sci., 2005)

An Extremal Problem On Potentially Kr+1-H-graphic Sequences. - Chunhui Lai; Lili Hu (Ars Comb., 2010)

On Potentially (K5 - C4)-graphic Sequences. - Lili Hu; Chunhui Lai (Ars Comb., 2011)

On Potentially K5 - E3-graphic Sequences. - Lili Hu; Chunhui Lai (Ars Comb., 2011)

The smallest degree sum that yields potentially Kr+1-Z-graphical Sequences. - Chunhui Lai (Ars Comb., 2011)

A Characterization On Potentially K6 - C4-graphic Sequences. - Lili Hu; Chunhui Lai (Ars Comb., 2014)

A Characterization On Potentially K2, 5-graphic Sequences. - Lili Hu; Chunhui Lai (Ars Comb., 2014)

On Potentially C2, 6-graphic Sequences. - Haiyan Li; Chunhui Lai (Ars Comb., 2015)

On the size of graphs without repeated cycle lengths. - Chunhui Lai (Discret. Appl. Math., 2017)

On the number of edges in some graphs. - Chunhui Lai (Discret. Appl. Math., 2020)

An old problem of Erdős: A graph without two cycles of the same length. - Chunhui Lai (Discret. Appl. Math., 2023)