5 citations · 9 across the 8 of their papers we have counts for
8 papers
Complexity of tree-coloring interval graphs equitably
Bei Niu, Bi Li, Xin Zhang
An equitable tree--coloring of a graph is a vertex -coloring such that each color class induces a forest and the size of any two color classes differ by at most one. In this…
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…
Equitable partition of plane graphs with independent crossings into induced forests
Bei Niu, Xin Zhang, Yuping Gao
The cluster of a crossing in a graph drawing in the plane is the set of the four end-vertices of its two crossed edges. Two crossings are independent if their clusters do not inter…
A structure of 1-planar graph and its applications to coloring problems
Xin Zhang, Bei Niu, Jiguo Yu
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar grap…
A note on the edge partition of graphs containing either a light edge or an alternating 2-cycle
Xin Zhang, Bei Niu
Let be a hereditary graph class (i.e, every subgraph of belongs to ) such that every graph in has minimu…