A note on the edge partition of graphs containing either a light edge or an alternating 2-cycle. - Xin Zhang 017; Bei Niu (CoRR, 2018)

Equitable vertex arboricity of $d$-degenerate graphs. - Xin Zhang 017; Bei Niu; Yan Li; Bi Li 004 (CoRR, 2019)

Equitable tree-$O(d)$-coloring of $d$-degenerate graphs. - Xin Zhang 017; Bei Niu (CoRR, 2019)

A Structure of 1-Planar Graph and Its Applications to Coloring Problems. - Xin Zhang 017; Bei Niu; Jiguo Yu (Graphs Comb., 2019)

Complexity of Tree-Coloring Interval Graphs Equitably. - Bei Niu; Bi Li 004; Xin Zhang 017 (AAIM, 2020)

Light edges in 1-planar graphs of minimum degree 3. - Bei Niu; Xin Zhang 017 (Discret. Math., 2020)

Equitable partition of plane graphs with independent crossings into induced forests. - Bei Niu; Xin Zhang 017; Yuping Gao (Discret. Math., 2020)

Equitable partition of graphs into induced linear forests. - Xin Zhang 017; Bei Niu (J. Comb. Optim., 2020)

On (p, 1)-total labelling of some 1-planar graphs. - Bei Niu; Xin Zhang 017 (Discuss. Math. Graph Theory, 2021)

Hardness and algorithms of equitable tree-coloring problem in chordal graphs. - Bei Niu; Bi Li 004; Xin Zhang 017 (Theor. Comput. Sci., 2021)

An Improvement of the Bound on the Odd Chromatic Number of 1-Planar Graphs. - Bei Niu; Xin Zhang 017 (AAIM, 2022)

Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy. - Xin Zhang 017; Huaqiang Zhang; Bei Niu; Bi Li 004 (Theor. Comput. Sci., 2022)

Some new results on equitable tree-coloring parameters of graphs. - Bei Niu (Theor. Comput. Sci., 2025)