Bei Niu

According to our database, Bei Niu authored at least 12 papers between 2018 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy.

Xin Zhang, Huaqiang Zhang, Bei Niu, Bi Li

Theor. Comput. Sci., 2022

An Improvement of the Bound on the Odd Chromatic Number of 1-Planar Graphs.

Bei Niu, Xin Zhang

Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021

Hardness and algorithms of equitable tree-coloring problem in chordal graphs.

Bei Niu, Bi Li, Xin Zhang

Theor. Comput. Sci., 2021

On <i>(p, 1)</i>-total labelling of some 1-planar graphs.

Bei Niu, Xin Zhang

Discuss. Math. Graph Theory, 2021

2020

Equitable partition of graphs into induced linear forests.

Xin Zhang, Bei Niu

J. Comb. Optim., 2020

Equitable partition of plane graphs with independent crossings into induced forests.

Bei Niu, Xin Zhang, Yuping Gao

Discret. Math., 2020

Light edges in 1-planar graphs of minimum degree 3.

Bei Niu, Xin Zhang

Discret. Math., 2020

Complexity of Tree-Coloring Interval Graphs Equitably.

Bei Niu, Bi Li, Xin Zhang

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

A Structure of 1-Planar Graph and Its Applications to Coloring Problems.

Xin Zhang, Bei Niu, Jiguo Yu

Graphs Comb., 2019

Equitable tree-$O(d)$-coloring of $d$-degenerate graphs.

Xin Zhang, Bei Niu

CoRR, 2019

Equitable vertex arboricity of $d$-degenerate graphs.

Xin Zhang, Bei Niu, Yan Li, Bi Li

CoRR, 2019

2018

A note on the edge partition of graphs containing either a light edge or an alternating 2-cycle.

Xin Zhang, Bei Niu

CoRR, 2018