Full List of Publications
2023
82. Xuqing Bai, Bi Li*, Chuandong Xu, Xin Zhang*, Fast Algorithm for the Rainbow Disconnection Coloring of 2-Trees, Journal of the Operations Research Society of China (2023). https://doi.org/10.1007/s40305-023-00498-w.
81. Huimin Bi, Xin Zhang*, Defective incidence coloring of graphs, Applied Mathematics and Computation 443 (2023) #127781.
80. J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, Xin Zhang, Counting cliques in 1-planar graphs, European Journal of Combinatorics 109 (2023) #103654.
2022
79. Bei Niu, Xin Zhang*, An Improvement of the Bound on the Odd Chromatic Number of 1-Planar Graphs, In: Q. Ni and W. Wu (eds) Algorithmic Aspects in Information and Management. AAIM 2022. Lecture Notes in Computer Science, 13513 (2022) 388-393.
78. 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.
2021
77. 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.
76. 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.
75. 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.
74. Huimin Bi, Xin Zhang*, Incidence coloring of Mycielskians with fast algorithm, Theoretical Computer Science 878-879 (2021) 1-10.
73. Huaqiang Zhang, Xin Zhang*, Theoretical aspects of equitable partition of networks into sparse modules, Theoretical Computer Science 871 (2021) 51-61.
72. Xin Zhang, Bi Li, Linear arboricity of outer-1-planar graphs, Journal of the Operations Research Society of China 9 (2021) 181-193.
71. Ringi Kim, Sang-il Oum, Xin Zhang, Equitable partition of planar graphs, Discrete Mathematics 344(6) (2021) #112351.
70. Xin Zhang, Yan Li, Dynamic list coloring of 1-planar graphs, Discrete Mathematics 344(5) (2021) #112333.
69. Bei Niu, Bi Li*, Xin Zhang, Hardness and algorithms of equitable tree-coloring problem in chordal graphs, Theoretical Computer Science, 857 (2021) 8–15.
68. Yan Li, Xin Zhang*, Equitable list tree-coloring of bounded treewidth graphs, Theoretical Computer Science, 855 (2021) 61–67.
67. Bei Niu, Xin Zhang*, On (p,1)-total labelling of some 1-planar graphs, Discussiones Mathematicae Graph Theory, 41 (2021) 531–558.
2020
66. Xin Zhang, List Edge Coloring of Outer-1-planar Graphs. Acta Mathematicae Applicatae Sinica, English Series, 36 (2020) 737–752.
65. Bei Niu, Bi Li, Xin Zhang, Complexity of Tree-Coloring Interval Graphs Equitably. In: Zhang Z., Li W., Du DZ. (eds) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science, 12290 (2020) 391-398. (Conference paper)
64. Weichan Liu, Xin Zhang*, Total Coloring of Outer-1-planar Graphs: The Cold Case. In: Zhang Z., Li W., Du DZ. (eds) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science, 12290 (2020) 469-480. (Conference paper)
63. Bei Niu, Xin Zhang*, Yuping Gao, Equitable partition of plane graphs with independent crossings into induced forests, Discrete Mathematics, 343(5) (2020) #111792.
62. Xin Zhang, Bei Niu, Equitable partition of graphs into induced linear forests, Journal of Combinatorial Optimization, 39(2) (2020) 588-581.
61. Bi Li, Xin Zhang, Tree-coloring problems of bounded treewidth graphs, Journal of Combinatorial Optimization, 39(1) (2020) 156-169.
60. Bei Niu, Xin Zhang*, Light edges in 1-planar graphs of minimum degree 3, Discrete Mathematics, 343(2) (2020) #111664.
2019
59. Bei Niu, Xin Zhang*, Linear arboricity of NIC-planar graphs, Acta Mathematicae Applicatae Sinica, English Series, 35(4) (2019) 924–934.
58. 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.
57. 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.
2018
56. Aijun Dong, Xin Zhang, Equitable coloring and equitable choosability of graphs with small maximum average degree, Discussiones Mathematicae Graph Theory, 38 (2018) 829-839.
55. 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.
54. Xin Zhang, Huijuan Wang, Lan Xu, Equitable coloring of three classes of 1-planar graphs, Acta Mathematicae Applicatae Sinica, English Series, 34(2) (2018) 362–372.
53. Weichan Liu, Chen Gong, Lifang Wu, Xin Zhang*, A note on the vertex arboricity of signed graphs, Utilitas Mathematica, 106 (2018) 251-258.
2017
52. Yong Yu, Xin Zhang*, Guanghui Wang, Guizhen Liu, Jinbo Li, (2,1)-Total labelling of planar graphs with large maximum degree, Journal of Discrete Mathematical Sciences & Cryptography, 20(8) (2017) 1625-1636.
51. Xin Zhang, Total coloring of outer-1-planar graphs with near-independent crossings, Journal of Combinatorial Optimization, 34(3) (2017) 661-675.
50. Dai-Qiang Hu, Jian-Liang Wu, Donglei Yang, Xin Zhang, On the equitable edge-coloring of 1-planar graphs and planar graphs, Graphs and Combinatorics, 33 (2017) 945–953.
49. Jiaqiang Ma, Renfeng Zhou, Xue Deng, Chenggang Wang, Xin Zhang*, on r-equitable colorings of bipartite graphs, Utilitas Mathematica, 103 (2017) 161-165.
48. Xin Zhang, List vertex arboricity of graphs without forbidden minors, Ars Combinatoria, 133 (2017) 349-353.
47. Huijuan Wang, Bin Liu, Yan Gu, Xin Zhang, Weili Wu, Hongwei Gao, Total coloring of planar graphs without adjacent short cycles, Journal of Combinatorial Optimization, 33(1) (2017) 265-274.
2016
46. Huijuan Wang, Bin Liu, Xin Zhang, Lidong Wu, Weili Wu, Hongwei Gao, List edge and list total coloring of planar graphs with maximum degree 8, Journal of Combinatorial Optimization, 32(1) (2016) 188-197.
45. Xin Zhang, On equitable colorings of sparse graphs, Bulletin of the Malaysian Mathematical Sciences Society, 39(1) (2016) 257-268.
44. Xin Zhang, Equitable list point arboricity of graphs, Filomat, 30(2) (2016) 373-378.
43. Huijuan Wang, Lidong Wu, Xin Zhang, Weili Wu, Bin Liu, A note on the minimum number of choosability of planar graphs, Journal of Combinatorial Optimization, 31(3) (2016) 1013-1022.
42. Xin Zhang, Equitable vertex arboricity of subcubic graphs, Discrete Mathematics, 339 (2016) 1724-1726.
41. Xin Zhang, The edge chromatic number of outer-1-planar graphs, Discrete Mathematics, 339 (2016) 1393-1399.
2015
40. Xin Zhang, Jianfeng Hou, Guizhen Liu, On total coloring of 1-planar graphs, Journal of Combinatorial Optimization, 30(1) (2015) 160-173.
39. 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.
38. Jingjing Tian, Xin Zhang*, Light triangles in plane graphs with near-independent crossings, Utilitas Mathematica, 97 (2015), 399-405.
37. Zhidan Yan, Wei Wang, Xin Zhang*, Equitable colorings of Cartesian products with balanced complete multipartite graphs, Discrete Applied Mathematics,180 (2015) 200-203.
36. Xin Zhang, Equitable vertex arboricity of planar graphs, Taiwanese Journal of Mathematics, 19(1) (2015) 123-131.
2014
35. Wei Wang, Zhidan Yan, Xin Zhang*, On r-equitable chromatic threshold of Kronecker products of complete graphs, Discrete Applied Mathematics, 175 (2014) 129-134.
34. Xin Zhang, Drawing complete multipartite graphs on the plane with restrictions on crossings, Acta Mathematica Sinica, English Series, 30(12) (2014) 2045-2053.
33. Xin Zhang, Light 3-cycles in 1-planar graphs with degree restrictions, Bulletin of the Korean Mathematical Society, 51(2) (2014) 511-517.
32. Xin Zhang, A note one the weight of triangle in 1-planar graphs with minimum degree 6, Utilitas Mathematica, 93 (2014) 129-134.
31. Xin Zhang, Jian-Liang Wu, A conjecture on equitable vertex arboricity of graphs, Filomat 28(1) (2014) 217-219.
30. Jingjing Tian, Xin Zhang*, Pseudo-outerplanar graphs and chromatic conjectures, Ars Combinatoria, 114 (2014) 353-361.
29. Xin Zhang, Guizhen Liu, On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree, Ars Mathematica Contemporanea 7(2) (2014) 233-243.
2013
28. Jian-Liang Wu, Xin Zhang, Hailun Li, Equitable vertex arboricity of graphs, Discrete Mathematics, 313 (2013) 2696-2701.
27. Xin Zhang, List total coloring of pseudo-outerplanar graphs, Discrete Mathematics 313 (2013) 2297-2306.
26. Xin Zhang, Guizhen Liu, Group edge choosability of planar graphs without adjacent short cycles, Acta Mathematica Sinica, English Series 29(11) (2013) 2079-2086.
25. Renyu Xu, Jian-Liang Wu, Guanghui Wang, Xin Zhang, On the sum of powers of the degrees of graphs, Bulletin of the Australian Mathematical Society 88(3) (2013) 353-358.
24. 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.
23. Xin Zhang, Guizhen Liu, On edge colorings of 1-toroidal graphs, Acta Mathematica Sinica, English Series 29(7) (2013) 1421-1428.
2012
22. Xin Zhang, Guizhen Liu, Jian-Liang Wu, k-forested choosability of graphs with bounded maximum average degree, Bulletin of the Iranian Mathematical Society38(1) (2012) 193-201.
21. Aijun Dong, Xin Zhang, Guojun Li, Equitable coloring and equitable choosability of planar graphs without 5- and 7-cycles, Bulletin of the Malaysian Mathematical Sciences Society 35(4) (2012) 897-910.
20. Xin Zhang, Guizhen Liu, Yong Yu, On (p,1)-total labelling of plane graphs with independent crossings, FILOMAT 26(6) (2012) 1091-1100.
19. Xin Zhang, Jian-Liang Wu, Guizhen Liu, List edge and list total coloring of 1-planar graphs, Frontiers of Mathematics in China 7(5) (2012) 1005-1018.
18. Xin Zhang, Guizhen Liu, On edge colorings of 1-planar graphs without adjacent triangles, Information Processing Letters 112 (2012) 138-142.
17. Xin Zhang, Guizhen Liu, Jian-Liang Wu, k-forested choosability of planar graphs and of sparse graphs, Discrete Mathematics 312 (2012) 999-1005.
16. Xin Zhang, Guizhen Liu, Jian-Liang Wu, Light subgraphs in the family of 1-planar graphs with high minimum degree, Acta Mathematica Sinica, English Series, 28(6) (2012) 1155-1168.
15. Aijun Dong, Xiang Tan, Xin Zhang, Guojun Li, Equitable coloring and equitable choosability of planar graphs without 6- and 7-cycles, Ars Combinatoria 103 (2012) 333-352.
14. Xin Zhang, Guizhen Liu, On edge colorings of 1-planar graphs without chordal 5-cycles, Ars Combinatoria 104 (2012) 431-436.
13. 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.
12. Xin Zhang, Guizhen Liu, Jian-Liang Wu, (1, λ)-embedded graphs and the acyclic edge choosability, Bulletin of the Korean Mathematical Society 49(3)(2012) 573-580.
11. Xin Zhang, Guizhen Liu, Jian-Liang Wu, Edge covering pseudo-outerplanar graphs with forests, Discrete Mathematics 312 (2012) 2788-2799.
2011
10. Xin Zhang, Jian-Liang Wu, On edge colorings of 1-planar graphs, Information Processing Letters 111 (2011) 124-128.
9. Xin Zhang, Jian-Liang Wu, On equitable and equitable list colorings of series-parallel graphs, Discrete Mathematics 311 (2011) 800–803.
8. Hao Fan, H. A. Kierstead, Guizhen Liu, Theodore Molla, Jian-Liang Wu, Xin Zhang*, A note on relaxed equitable coloring of graphs, Information Processing Letters 111 (2011) 1062-1066.
7. Xin Zhang, Yong Yu, Guizhen Liu, On (p,1)-total labelling of 1-planar graphs, Central European Journal of Mathematics 9(6) (2011) 1424-1434.
6. 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.
5. Xin Zhang, Guizhen Liu, Jian-Liang Wu, On the linear arboricity of 1-planar graphs, OR Transactions 15(3) (2011) 38-44.
4. Yong Yu, Xin Zhang, Guizhen Liu. List (d,1)-total labelling of graphs em[ant]bedded in surfaces, OR Transactions 15(3) (2011) 29-37.
3. Xin Zhang, Jian-Liang Wu, Jin Yan, Degree conditions for the partition of a graph into triangles and quadrilaterals, Utilitas Mathmatica 86 (2011) 341-346.
2010
2. Xin Zhang, Guizhen Liu, Jian-Liang Wu, k-forested coloring of planar graphs with large girth, Proc. Japan Acad. Ser. A Math. Sci. 86 (2010) 169-173.
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.