3 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2011★ 1 cited
k-forested choosability of graphs with bounded maximum average degree
Xin Zhang, Guizhen Liu, Jian-Liang Wu
A proper vertex coloring of a simple graph is -forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than . A graph is $…
math.CO2010★ 3 cited
Edge Coloring of Triangle-Free 1-Planar Graphs
Xin Zhang, Guizhen Liu, Jian-Liang Wu
it is shown that each triangle-free 1-planar graph with maximum degree can be -colorable by Discharging Method.