9 citations · 46 across the 37 of their papers we have counts for
10 papers · 1 filter
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…
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…
Light edges in 1-planar graphs of minimum degree 3
Bei Niu, Xin Zhang
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at le…
Equitable partition of graphs into induced linear forests
Xin Zhang, Bei Niu
It is proved that the vertex set of any simple graph can be equitably partitioned into subsets for any integer $k\geq\max\{\big\lceil\frac{Δ(G)+1}{2}\big\rceil,\big\lceil\f…
Equitable tree--coloring of -degenerate graphs
Xin Zhang, Bei Niu
An equitable tree--coloring of a graph is a vertex coloring on colors so that every color class incudes a forest and the sizes of any two color classes differ by at most one…
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…