2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2019★ 2 cited
Dynamic list coloring of 1-planar graphs
Xin Zhang, Yan Li
A graph is -planar if it can be drawn in the plane so that each edge is crossed at most times. Typically, the class of 1-planar graphs is among the most investigated graph f…
math.CO2019★ 1 cited
The structure and the list 3-dynamic coloring of outer-1-planar graphs
Yan Li, Xin Zhang
An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge. Th…
math.CO2019
Equitable vertex arboricity conjecture holds for graphs with low degeneracy
Xin Zhang, Bei Niu, Yan Li +1
The equitable tree-coloring can formulate a structure decomposition problem on the communication network with some security considerations. Namely, an equitable tree--coloring o…