Structural properties of 1-planar graphs and an application to acyclic edge coloring - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (CoRR, 2010)

Degree conditions for the partition of a graph into triangles and quadrilaterals - Xin Zhang 017; Jianliang Wu 001; Jin Yan (CoRR, 2010)

Edge Coloring of Triangle-Free 1-Planar Graphs - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (CoRR, 2010)

Vertex-disjoint triangles in K1, t-free graphs with minimum degree at least t. - Xin Zhang 017; Na Li; Jianliang Wu 001; Jin Yan (Discret. Math., 2010)

k-forested choosability of graphs with bounded maximum average degree - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (CoRR, 2011)

Group edge choosability of planar graphs without adjacent short cycles - Xin Zhang 017; Guizhen Liu (CoRR, 2011)

List (d,1)-total labelling of graphs embedded in surfaces - Yong Yu; Xin Zhang 017; Guizhen Liu (CoRR, 2011)

(2,1)-Total labeling of planar graphs with large maximum degree - Yong Yu; Xin Zhang 017; Guanghui Wang 002; Jinbo Li (CoRR, 2011)

(1,λ)-embedded graphs and the acyclic edge choosability - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (CoRR, 2011)

Total coloring of pseudo-outerplanar graphs - Xin Zhang 017; Guizhen Liu (CoRR, 2011)

On equitable and equitable list colorings of series-parallel graphs. - Xin Zhang 017; Jianliang Wu 001 (Discret. Math., 2011)

New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree. - Xin Zhang 017; Jianliang Wu 001; Guizhen Liu (Discret. Math. Theor. Comput. Sci., 2011)

A note on relaxed equitable coloring of graphs. - Hao Fan; Hal A. Kierstead; Guizhen Liu; Theodore Molla; Jianliang Wu 001; Xin Zhang 017 (Inf. Process. Lett., 2011)

On edge colorings of 1-planar graphs. - Xin Zhang 017; Jianliang Wu 001 (Inf. Process. Lett., 2011)

Equitable Coloring and Equitable Choosability of Planar Graphs without 6- and 7-Cycles. - Aijun Dong; Guojun Li; Xiang Tan; Xin Zhang 017 (Ars Comb., 2012)

On edge colorings of 1-planar graphs without chordal 5-cycles. - Xin Zhang 017; Guizhen Liu (Ars Comb., 2012)

Equitable vertex arboricity of graphs - Jianliang Wu 001; Xin Zhang 017; Hailun Li (CoRR, 2012)

A conjecture on equitable vertex arboricity of graphs - Xin Zhang 017; Jianliang Wu 001 (CoRR, 2012)

On r-acyclic edge colorings of planar graphs. - Xin Zhang 017; Guanghui Wang 002; Yong Yu; Jinbo Li; Guizhen Liu (Discret. Appl. Math., 2012)

1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs. - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (Discret. Math., 2012)

Edge covering pseudo-outerplanar graphs with forests. - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (Discret. Math., 2012)

On edge colorings of 1-planar graphs without adjacent triangles. - Xin Zhang 017; Guizhen Liu (Inf. Process. Lett., 2012)

Equitable vertex arboricity of graphs. - Jian-Liang Wu 001; Xin Zhang 017; Hailuan Li (Discret. Math., 2013)

List total coloring of pseudo-outerplanar graphs. - Xin Zhang 017 (Discret. Math., 2013)

On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree. - Xin Zhang 017; Guizhen Liu (Ars Math. Contemp., 2014)

On r-equitable chromatic threshold of Kronecker products of complete graphs. - Wei Wang 052; Zhidan Yan; Xin Zhang 017 (Discret. Appl. Math., 2014)

Equitable colorings of Cartesian products with balanced complete multipartite graphs. - Zhidan Yan; Wei Wang 052; Xin Zhang 017 (Discret. Appl. Math., 2015)

The r-acyclic chromatic number of planar graphs. - Guanghui Wang 002; Guiying Yan; Jiguo Yu; Xin Zhang 017 (J. Comb. Optim., 2015)

On total colorings of 1-planar graphs. - Xin Zhang 017; Jianfeng Hou; Guizhen Liu (J. Comb. Optim., 2015)

Equitable vertex arboricity of subcubic graphs. - Xin Zhang 017 (Discret. Math., 2016)

The edge chromatic number of outer-1-planar graphs. - Xin Zhang 017 (Discret. Math., 2016)

List edge and list total coloring of planar graphs with maximum degree 8. - Huijuan Wang; Bin Liu 009; Xin Zhang 017; Lidong Wu; Weili Wu 001; Hongwei Gao (J. Comb. Optim., 2016)

A note on the minimum number of choosability of planar graphs. - Huijuan Wang; Lidong Wu; Xin Zhang 017; Weili Wu 001; Bin Liu 009 (J. Comb. Optim., 2016)

On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs. - Daiqiang Hu; Jian-Liang Wu 001; Donglei Yang; Xin Zhang 017 (Graphs Comb., 2017)

Total coloring of planar graphs without adjacent short cycles. - Huijuan Wang; Bin Liu 009; Yan Gu 007; Xin Zhang 017; Weili Wu 001; Hongwei Gao (J. Comb. Optim., 2017)

Total coloring of outer-1-planar graphs with near-independent crossings. - Xin Zhang 017 (J. Comb. Optim., 2017)

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 coloring and equitable choosability of graphs with small maximum average degree. - Aijun Dong; Xin Zhang 017 (Discuss. Math. Graph Theory, 2018)

Light paths and edges in families of outer-1-planar graphs. - Xin Zhang 017; Jingfen Lan; Bi Li 004; Qiang Zhu 003 (Inf. Process. Lett., 2018)

Upper bound on the sum of powers of the degrees of graphs with few crossings per edge. - Xin Zhang 017 (Appl. Math. Comput., 2019)

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)

Total Coloring of Outer-1-planar Graphs: The Cold Case. - Weichan Liu; Xin Zhang 017 (AAIM, 2020)

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)

Tree-coloring problems of bounded treewidth graphs. - Bi Li 004; Xin Zhang 017 (J. Comb. Optim., 2020)

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

Equitable partition of planar graphs. - Ringi Kim; Sang-il Oum; Xin Zhang 017 (Discret. Math., 2021)

Dynamic list coloring of 1-planar graphs. - Xin Zhang 017; Yan Li (Discret. Math., 2021)

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

The structure and the list 3-dynamic coloring of outer-1-planar graphs. - Yan Li; Xin Zhang 017 (Discret. Math. Theor. Comput. Sci., 2021)

Incidence coloring of Mycielskians with fast algorithm. - Huimin Bi; Xin Zhang 017 (Theor. Comput. Sci., 2021)

h-extra r-component connectivity of interconnection networks with application to hypercubes. - Bi Li 004; Jingfen Lan; Wantao Ning; Yongcui Tian; Xin Zhang 017; Qiang Zhu 003 (Theor. Comput. Sci., 2021)

Equitable list tree-coloring of bounded treewidth graphs. - Yan Li; Xin Zhang 017 (Theor. Comput. Sci., 2021)

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

Theoretical aspects of equitable partition of networks into sparse modules. - Huaqiang Zhang; 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)

Defective incidence coloring of graphs. - Huimin Bi; Xin Zhang 017 (Appl. Math. Comput., 2023)

Improper odd coloring of IC-planar graphs. - Ping Chen; Xin Zhang 017 (Discret. Appl. Math., 2024)

On proper conflict-free colorings of IC-planar graphs. - Yali Wu; Xin Zhang 017 (Discret. Appl. Math., 2025)

Every subcubic graph is packing (1,1,2,2,3)-colorable. - Xujun Liu; Xin Zhang 017; Yanting Zhang (Discret. Math., 2025)

Proper conflict-free coloring of Mycielskians with fast algorithms. - Yali Wu; Xin Zhang 017 (Theor. Comput. Sci., 2025)

Equitable Vertex Arboricity of Graphs with Low Maximum Degree. - Ping Chen; Weichan Liu; Xin Zhang 017 (Graphs Comb., 2025)