4 citations · 22 across the 22 of their papers we have counts for
22 papers
An old problem of Erdős: a graph without two cycles of the same length
Chunhui Lai
In 1975, P. Erdős proposed the problem of determining the maximum number of edges in a graph on vertices in which any two cycles are of different lengths. Let $f^{\ast}(…
On the number of edges in some graphs
Chunhui Lai
In 1975, P. Erdős proposed the problem of determining the maximum number of edges in a graph with vertices in which any two cycles are of different lengths. The sequence…
On the size of graphs without repeated cycle lengths
Chunhui Lai
In 1975, P. Erdös proposed the problem of determining the maximum number of edges in a graph of vertices in which any two cycles are of different lengths. In this paper,…
Some unsolved problems on cycles
Chunhui Lai, Mingjing Liu
Hajos' conjecture that every simple even graph on vertices can be decomposed into at most cycles (see L. Lovasz, On covering of graphs, in: P. Erdos, G.O.H. Katona (E…
A Characterization On Potentially -graphic Sequences
Lili Hu, Chunhui Lai
For given a graph , a graphic sequence is said to be potentially -graphic if there exists a realization of containing as a subgraph. Let …
A Characterization On Potentially -graphic Sequences
Lili Hu, Chunhui Lai
For given a graph , a graphic sequence is said to be potentially -graphic if there exists a realization of containing as a subgraph. Let …