Xin Zhang

According to our database, Xin Zhang authored at least 60 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Defective incidence coloring of graphs.

Huimin Bi, Xin Zhang

Appl. Math. Comput., 2023

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

Theoretical aspects of equitable partition of networks into sparse modules.

Huaqiang Zhang, Xin Zhang

Theor. Comput. Sci., 2021

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

Bei Niu, Bi Li, Xin Zhang

Theor. Comput. Sci., 2021

Equitable list tree-coloring of bounded treewidth graphs.

Yan Li, Xin Zhang

Theor. Comput. Sci., 2021

<i>h</i>-extra <i>r</i>-component connectivity of interconnection networks with application to hypercubes.

Bi Li, Jingfen Lan, Wantao Ning, Yongcui Tian, Xin Zhang, Qiang Zhu

Theor. Comput. Sci., 2021

Incidence coloring of Mycielskians with fast algorithm.

Huimin Bi, Xin Zhang

Theor. Comput. Sci., 2021

The structure and the list 3-dynamic coloring of outer-1-planar graphs.

Yan Li, Xin Zhang

Discret. Math. 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

Dynamic list coloring of 1-planar graphs.

Xin Zhang, Yan Li

Discret. Math., 2021

Equitable partition of planar graphs.

Ringi Kim, Sang-il Oum, Xin Zhang

Discret. Math., 2021

2020

Equitable partition of graphs into induced linear forests.

Xin Zhang, Bei Niu

J. Comb. Optim., 2020

Tree-coloring problems of bounded treewidth graphs.

Bi Li, Xin Zhang

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

Total Coloring of Outer-1-planar Graphs: The Cold Case.

Weichan Liu, 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

Upper bound on the sum of powers of the degrees of graphs with few crossings per edge.

Xin Zhang

Appl. Math. Comput., 2019

2018

Light paths and edges in families of outer-1-planar graphs.

Xin Zhang, Jingfen Lan, Bi Li, Qiang Zhu

Inf. Process. Lett., 2018

Equitable coloring and equitable choosability of graphs with small maximum average degree.

Aijun Dong, Xin Zhang

Discuss. Math. Graph Theory, 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

2017

Total coloring of outer-1-planar graphs with near-independent crossings.

Xin Zhang

J. Comb. Optim., 2017

Total coloring of planar graphs without adjacent short cycles.

Huijuan Wang, Bin Liu, Yan Gu, Xin Zhang, Weili Wu, Hongwei Gao

J. Comb. Optim., 2017

On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs.

Daiqiang Hu, Jian-Liang Wu, Donglei Yang, Xin Zhang

Graphs Comb., 2017

2016

A note on the minimum number of choosability of planar graphs.

Huijuan Wang, Lidong Wu, Xin Zhang, Weili Wu, Bin Liu

J. Comb. Optim., 2016

List edge and list total coloring of planar graphs with maximum degree 8.

Huijuan Wang, Bin Liu, Xin Zhang, Lidong Wu, Weili Wu, Hongwei Gao

J. Comb. Optim., 2016

The edge chromatic number of outer-1-planar graphs.

Xin Zhang

Discret. Math., 2016

Equitable vertex arboricity of subcubic graphs.

Xin Zhang

Discret. Math., 2016

2015

On total colorings of 1-planar graphs.

Xin Zhang, Jianfeng Hou, Guizhen Liu

J. Comb. Optim., 2015

The r-acyclic chromatic number of planar graphs.

Guanghui Wang, Guiying Yan, Jiguo Yu, Xin Zhang

J. Comb. Optim., 2015

Equitable colorings of Cartesian products with balanced complete multipartite graphs.

Zhidan Yan, Wei Wang, Xin Zhang

Discret. Appl. Math., 2015

2014

On r-equitable chromatic threshold of Kronecker products of complete graphs.

Wei Wang, Zhidan Yan, Xin Zhang

Discret. Appl. Math., 2014

On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree.

Xin Zhang, Guizhen Liu

Ars Math. Contemp., 2014

2013

List total coloring of pseudo-outerplanar graphs.

Xin Zhang

Discret. Math., 2013

Equitable vertex arboricity of graphs.

Jian-Liang Wu, Xin Zhang, Hailuan Li

Discret. Math., 2013

2012

On edge colorings of 1-planar graphs without adjacent triangles.

Xin Zhang, Guizhen Liu

Inf. Process. Lett., 2012

Edge covering pseudo-outerplanar graphs with forests.

Xin Zhang, Guizhen Liu, Jianliang Wu

Discret. Math., 2012

1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs.

Xin Zhang, Guizhen Liu, Jianliang Wu

Discret. Math., 2012

On r-acyclic edge colorings of planar graphs.

Xin Zhang, Guanghui Wang, Yong Yu, Jinbo Li, Guizhen Liu

Discret. Appl. Math., 2012

A conjecture on equitable vertex arboricity of graphs

Xin Zhang, Jianliang Wu

CoRR, 2012

Equitable vertex arboricity of graphs

Jianliang Wu, Xin Zhang, Hailun Li

CoRR, 2012

On edge colorings of 1-planar graphs without chordal 5-cycles.

Xin Zhang, Guizhen Liu

Ars Comb., 2012

Equitable Coloring and Equitable Choosability of Planar Graphs without 6- and 7-Cycles.

Aijun Dong, Guojun Li, Xiang Tan, Xin Zhang

Ars Comb., 2012

2011

On edge colorings of 1-planar graphs.

Xin Zhang, Jianliang Wu

Inf. Process. Lett., 2011

A note on relaxed equitable coloring of graphs.

Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang

Inf. Process. Lett., 2011

New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree.

Xin Zhang, Jianliang Wu, Guizhen Liu

Discret. Math. Theor. Comput. Sci., 2011

On equitable and equitable list colorings of series-parallel graphs.

Xin Zhang, Jianliang Wu

Discret. Math., 2011

Total coloring of pseudo-outerplanar graphs

Xin Zhang, Guizhen Liu

CoRR, 2011

(1,λ)-embedded graphs and the acyclic edge choosability

Xin Zhang, Guizhen Liu, Jianliang Wu

CoRR, 2011

List (d,1)-total labelling of graphs embedded in surfaces

Yong Yu, Xin Zhang, Guizhen Liu

CoRR, 2011

Group edge choosability of planar graphs without adjacent short cycles

Xin Zhang, Guizhen Liu

CoRR, 2011

k-forested choosability of graphs with bounded maximum average degree

Xin Zhang, Guizhen Liu, Jianliang Wu

CoRR, 2011

2010

Vertex-disjoint triangles in K_{1, t}-free graphs with minimum degree at least t.

Xin Zhang, Na Li, Jianliang Wu, Jin Yan

Discret. Math., 2010

Edge Coloring of Triangle-Free 1-Planar Graphs

Xin Zhang, Guizhen Liu, Jianliang Wu

CoRR, 2010

Degree conditions for the partition of a graph into triangles and quadrilaterals

Xin Zhang, Jianliang Wu, Jin Yan

CoRR, 2010

Structural properties of 1-planar graphs and an application to acyclic edge coloring

Xin Zhang, Guizhen Liu, Jianliang Wu

CoRR, 2010