Ye Chen

Every N 2-locally connected claw-free graph with minimum degree at least 7 is Z 3-connected

H. Lai, Ping Li, Erling Wei, 2011 .

GRAPH WITH MINIMUM DEGREE AT LEAST 7

H. Lai, Ping Li, Erling Wei, 2011 .

Graph r-hued colorings—A survey

H. Lai, S. Fan, Ye Chen, 2022, Discrete Applied Mathematics.

Supereulerian graphs with width s and s-collapsible graphs

Hong-Jian Lai, Hao Li, Ping Li, 2016, Discret. Appl. Math..

On Spanning Disjoint Paths in Line Graphs

H. Lai, Ping Li, Zhi-Hong Chen, 2013, Graphs Comb..

On dynamic coloring for planar graphs and graphs of higher genus

Hong-Jian Lai, Lei Sun, Ye Chen, 2012, Discret. Appl. Math..