44. Huimin Bi, Xin Zhang*, Defective incidence coloring of graphs, Applied Mathematics and Computation 443 (2023) #127781.
43. J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, Xin Zhang, Counting cliques in 1-planar graphs, European Journal of Combinatorics 109 (2023) #103654.
42. Xin Zhang*, Huaqiang Zhang, Bei Niu, Bi Li*, Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy, Theoretical Computer Science 905 (2022) 18-30.
41. Bi Li, Jingfen Lan, Wantao Ning, Yongcui Tian, Xin Zhang, Qiang Zhu*，h-extra r-component connectivity of interconnection networks with application to hypercubes, Theoretical Computer Science 895 (2021) 68-74.
40. Yan Li, Xin Zhang*, The structure and the list 3-dynamic coloring of outer-1-planar graphs, Discrete Mathematics & Theoretical Computer Science 23(3) (2021) #4.
39. Xin Zhang*, Bei Niu, Yan Li, Bi Li, Equitable vertex arboricity conjecture holds for graphs with low degeneracy, Acta Mathematica Sinica, English Series 37 (2021) 1293-1302.
38. Huimin Bi, Xin Zhang*, Incidence coloring of Mycielskians with fast algorithm, Theoretical Computer Science 878-879 (2021) 1-10.
37. Huaqiang Zhang, Xin Zhang*, Theoretical aspects of equitable partition of networks into sparse modules, Theoretical Computer Science 871 (2021) 51-61.
36. Ringi Kim, Sang-il Oum, Xin Zhang, Equitable partition of planar graphs, Discrete Mathematics 344(6) (2021) #112351.
35. Xin Zhang, Yan Li, Dynamic list coloring of 1-planar graphs, Discrete Mathematics 344(5) (2021) #112333.
34. Bei Niu, Bi Li*, Xin Zhang, Hardness and algorithms of equitable tree-coloring problem in chordal graphs, Theoretical Computer Science, 857 (2021) 8–15.
33. Bei Niu, Xin Zhang*, On (p,1)-total labelling of some 1-planar graphs, Discussiones Mathematicae Graph Theory, 41 (2021) 531–558.
32. Yan Li, Xin Zhang*, Equitable list tree-coloring of bounded treewidth graphs, Theoretical Computer Science, 855 (2021) 61–67.
31. Bei Niu, Xin Zhang*, Yuping Gao, Equitable partition of plane graphs with independent crossings into induced forests, Discrete Mathematics, 343(5) (2020) #111792.
30. Xin Zhang, Bei Niu, Equitable partition of graphs into induced linear forests, Journal of Combinatorial Optimization, 39(2) (2020) 588-581.
29. Bi Li, Xin Zhang, Tree-coloring problems of bounded treewidth graphs, Journal of Combinatorial Optimization, 39 (2020) 156-169.
28. Bei Niu, Xin Zhang*, Light edges in 1-planar graphs of minimum degree 3, Discrete Mathematics 343(2) (2020) #111664.
27. Xin Zhang, Bei Niu, Jiguo Yu, A structure of 1-planar graph and its applications to coloring problems, Graphs and Combinatorics, 35(3) (2019) 677-688.
26. Bei Niu, Xin Zhang*, On (p,1)-total labelling of some 1-planar graphs, Discussiones Mathematicae Graph Theory, 41 (2021) 531–558.
25. Xin Zhang, Upper bound on the sum of powers of the degrees of graphs with few crossings per edge, Applied Mathematics and Computation, 350 (2019) 163-169.
24. Xin Zhang, Jingfen Lan, Bi Li, Qiang Zhu, Light paths and edges in families of outer-1-planar graphs, Information Processing Letters, 136 (2018) 83-89.
23. Xin Zhang, Total coloring of outer-1-planar graphs with near-independent crossings, Journal of Combinatorial Optimization, 34(3) (2017) 661-675.
22. Xin Zhang, Equitable list point arboricity of graphs, Filomat, 30(2) (2016) 373-378.
21. Xin Zhang, Equitable vertex arboricity of subcubic graphs, Discrete Mathematics, 339 (2016) 1724-1726.
20. Xin Zhang, The edge chromatic number of outer-1-planar graphs, Discrete Mathematics, 339 (2016) 1393-1399.
19. Xin Zhang, Jianfeng Hou, Guizhen Liu, On total coloring of 1-planar graphs, Journal of Combinatorial Optimization, 30(1) (2015) 160-173.
18. Guanghui Wang, Guiying Yan, Jiguo Yu, Xin Zhang, The r-acyclic chromatic number of planar graphs, Journal of Combinatorial Optimization, 29(4) (2015) 713-722.
17. Zhidan Yan, Wei Wang, Xin Zhang*, Equitable colorings of Cartesian products with balanced complete multipartite graphs, Discrete Applied Mathematics,180 (2015) 200-203.
16. Xin Zhang, Equitable vertex arboricity of planar graphs, Taiwanese Journal of Mathematics, 19(1) (2015) 123-131.
15. Wei Wang, Zhidan Yan, Xin Zhang*, On r-equitable chromatic threshold of Kronecker products of complete graphs, Discrete Applied Mathematics, 175 (2014) 129-134.
14. Xin Zhang, Drawing complete multipartite graphs on the plane with restrictions on crossings, Acta Mathematica Sinica, English Series, 30(12) (2014) 2045-2053.
13. Xin Zhang, Jian-Liang Wu, A conjecture on equitable vertex arboricity of graphs, Filomat 28(1) (2014) 217-219.
12. Jian-Liang Wu, Xin Zhang, Hailun Li, Equitable vertex arboricity of graphs, Discrete Mathematics, 313 (2013) 2696-2701.
11. Xin Zhang, List total coloring of pseudo-outerplanar graphs, Discrete Mathematics 313 (2013) 2297-2306.
10. Xin Zhang, Guizhen Liu, The structure of plane graphs with independent crossings and its appications to coloring problems, Central European Journal of Mathematics 11(2) (2013) 308-321.
9. Xin Zhang, Guizhen Liu, On edge colorings of 1-planar graphs without adjacent triangles, Information Processing Letters 112 (2012) 138-142.
8. Xin Zhang, Guizhen Liu, Jian-Liang Wu, k-forested choosability of planar graphs and of sparse graphs, Discrete Mathematics 312 (2012) 999-1005.
7. Xin Zhang, Guanghui Wang, Yong Yu, Jinbo Li, Guizhen Liu, On r-acyclic edge colorings of planar graphs, Discrete Applied Mathematics 160 (2012) 2048-2053.
6. Xin Zhang, Guizhen Liu, Jian-Liang Wu, Edge covering pseudo-outerplanar graphs with forests, Discrete Mathematics 312 (2012) 2788-2799.
5. Xin Zhang, Jian-Liang Wu, On edge colorings of 1-planar graphs, Information Processing Letters 111 (2011) 124-128.
4. Xin Zhang, Jian-Liang Wu, On equitable and equitable list colorings of series-parallel graphs, Discrete Mathematics 311 (2011) 800–803.
3. Hao Fan, H. A. Kierstead, Guizhen Liu, Theodore Molla, Jian-Liang Wu, Xin Zhang*, A note on relaxed equitable coloring of graphs, Information Processing Letters111 (2011) 1062-1066.
2. Xin Zhang, Jian-Liang Wu, Guizhen Liu, New upper bounds for the heights of some light subgraphs in 1-planar graphs with high minimum degree, Discrete Mathematics and Theoretical Computer Science 13(3) (2011) 9-16.
1. Xin Zhang, Na Li, Jian-Liang Wu, Jin Yan, Vertex-disjoint triangles in K1,t-free graphs with minimum degree at least t, Discrete Mathematics 310 (2010) 2499-2503.