4 papers
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, a…
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…
On walk domination: Between different types of walks and -path
Hangdi Chen, Yuhan Ma, Qingjie Ye
Given two non-adjacent vertices \( u \) and \( v \), we say a -walk \( W \) dominates a -walk \( W' \) if every internal vertex of \( W' \) is adjacent to some internal ver…
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 gener…