We stand with Ukraine  

Chunhui Lai

Orcid: 0000-0002-0132-3368

According to our database1, Chunhui Lai authored at least 15 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An old problem of Erdős: A graph without two cycles of the same length.
[BibTeX]
[DOI]
Chunhui Lai
Discret. Appl. Math., October, 2023

2020
On the number of edges in some graphs.
[BibTeX]
[DOI]
Chunhui Lai
Discret. Appl. Math., 2020

2017
On the size of graphs without repeated cycle lengths.
[BibTeX]
[DOI]
Chunhui Lai
Discret. Appl. Math., 2017

2015
On Potentially C<sub>2, 6</sub>-graphic Sequences.
[BibTeX]
Haiyan Li
,
Chunhui Lai
Ars Comb., 2015

2014
A Characterization On Potentially K<sub>2, 5</sub>-graphic Sequences.
[BibTeX]
Lili Hu
,
Chunhui Lai
Ars Comb., 2014

A Characterization On Potentially K<sub>6</sub> - C<sub>4</sub>-graphic Sequences.
[BibTeX]
Lili Hu
,
Chunhui Lai
Ars Comb., 2014

2011
The smallest degree sum that yields potentially K<sub>r+1</sub>-Z-graphical Sequences.
[BibTeX]
Chunhui Lai
Ars Comb., 2011

On Potentially K<sub>5</sub> - E<sub>3</sub>-graphic Sequences.
[BibTeX]
Lili Hu
,
Chunhui Lai
Ars Comb., 2011

On Potentially (K<sub>5</sub> - C<sub>4</sub>)-graphic Sequences.
[BibTeX]
Lili Hu
,
Chunhui Lai
Ars Comb., 2011

2010
An Extremal Problem On Potentially K<sub>r+1</sub>-H-graphic Sequences.
[BibTeX]
Chunhui Lai
,
Lili Hu
Ars Comb., 2010

2005
An extremal problem on potentially <i>K</i><sub><i>p, 1, 1</i></sub> -graphic sequences.
[BibTeX]
[DOI]
Chunhui Lai
Discret. Math. Theor. Comput. Sci., 2005

2003
Graphs without repeated cycle lengths.
[BibTeX]
[DOI]
Chunhui Lai
Australas. J Comb., 2003

2001
A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length.
[BibTeX]
[DOI]
Chunhui Lai
Electron. J. Comb., 2001

A note on potentially K<sub>4</sub>-e graphical sequences.
[BibTeX]
[DOI]
Chunhui Lai
Australas. J Comb., 2001

1993
On the size of graphs with all cycle having distinct length.
[BibTeX]
[DOI]
Chunhui Lai
Discret. Math., 1993


  Loading...