16 citations · 17 across the 8 of their papers we have counts for
4 papers · 1 filter
Counterexamples to two conjectures on the diameter of clique-free graphs
Hangdi Chen, Yaojun Chen
Erdős et al. (JCT-B, 1989) conjectured that, for integers and with , every connected -free graph of order and minimum degree has diam…
On monochromatic path covers conjecture of Erdős--Gyárfás
Hangdi Chen, Yaojun Chen
Erdős and Gyárfás conjectured in 1995 that, in every red--blue edge-coloring of a complete graph , the vertex set can be covered by at most monochromatic paths, all…
On regular homogeneously traceable nonhamiltonian graphs
Hangdi Chen, Yaojun Chen
A graph is homogeneously traceable if each vertex is an endpoint of a Hamiltonian path. Chartrand, Gould, and Kapoor (1979) proved irregular homogeneously traceable nonhamiltonian…
The Turán number of the triangular pyramid of 4-layers
Hangdi Chen, Yaojun Chen, Xiutao Zhu
The Turán number of a graph is the maximum number of edges in any -free graph on vertices. The triangular pyramid of -layers, denoted by , is a genera…