85. Mengke Qi,Xin Zhang*, Incidence coloring of outer-1-planar graphs,Acta Mathematicae Applicatae Sinica, English Series40(3) (2024) 840-848 [PDF]中国数学会T2西电2类贡献度
84. Kejie Li,Xin Zhang*, Strong edge coloring of outerplane graphs with independent crossings,Acta Mathematicae Applicatae Sinica, English Series40(2) (2024) 467-477 [PDF]中国数学会T2西电2类贡献度
83. Xuqing Bai, Bi Li, Chuandong Xu*,Xin Zhang, Cooperative coloring of some graph families,Discrete Mathematics347(7) (2024) #113973 [PDF]中国数学会T2西电2类贡献度
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 [PDF]中国数学会T1
81. Huimin Bi,Xin Zhang*, Defective incidence coloring of graphs,Applied Mathematics and Computation443 (2023) #127781. [PDF]西电2类贡献度
80. J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins,Xin Zhang, Counting cliques in 1-planar graphs,European Journal of Combinatorics109 (2023) #103654. [PDF]中国数学会T3
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. (Conference paper)(EI检索号：20224012822181) [PDF]
78.Xin Zhang*, Huaqiang Zhang, Bei Niu, Bi Li*, Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy,Theoretical Computer Science905 (2022) 18-30.(SCI检索号：000753378000003) [PDF]西电1类贡献度
77. Bi Li, Jingfen Lan, Wantao Ning, Yongcui Tian,Xin Zhang, Qiang Zhu*，h-extrar-component connectivity of interconnection networks with application to hypercubes,Theoretical Computer Science895 (2021) 68-74. (SCI检索号：000718264000006) [PDF]西电1类贡献度
76.Yan Li,Xin Zhang*,The structure and the list 3-dynamic coloring of outer-1-planar graphs,Discrete Mathematics & Theoretical Computer Science23(3) (2021) #4.(SCI检索号：000715261300002)[PDF]
75.Xin Zhang*,Bei Niu, Yan Li, Bi Li,Equitable vertex arboricity conjecture holds for graphs with low degeneracy,Acta Mathematica Sinica, English Series37 (2021) 1293-1302. (SCI检索号：000691000200009) [PDF]中国数学会T1
74. Huimin Bi,Xin Zhang*, Incidence coloring of Mycielskians with fast algorithm,Theoretical Computer Science878-879 (2021) 1-10.(SCI检索号：000672551700001)[PDF]西电1类贡献度
73. Huaqiang Zhang,Xin Zhang*, Theoretical aspects of equitable partition of networks into sparse modules,Theoretical Computer Science871 (2021) 51-61.(SCI检索号：000651623200004)[PDF]西电1类贡献度
72.Xin Zhang, Bi Li, Linear arboricity of outer-1-planar graphs,Journal of the Operations Research Society of China9 (2021) 181-193.(EI检索号：20191606797520)[PDF]中国数学会T1
71. Ringi Kim, Sang-il Oum,Xin Zhang, Equitablepartition of planar graphs,Discrete Mathematics344(6) (2021)#112351. (SCI检索号：000640570000023) [PDF]中国数学会T2西电2类贡献度
70.Xin Zhang, Yan Li,Dynamic list coloring of 1-planar graphs,Discrete Mathematics344(5) (2021) #112333.(SCI检索号：000633365200005)[PDF]中国数学会T2西电2类贡献度
69. Bei Niu, Bi Li*,Xin Zhang,Hardness and algorithms of equitable tree-coloring problem in chordal graphs,Theoretical Computer Science857 (2021) 8–15. (SCI检索号：000613450400002) [PDF]西电1类贡献度
68. Yan Li,Xin Zhang*, Equitable list tree-coloring of bounded treewidth graphs,Theoretical Computer Science,855 (2021) 61–67. (SCI检索号：000608352600004) [PDF]西电1类贡献度
67. Bei Niu,Xin Zhang*, On (p,1)-total labelling of some 1-planar graphs,Discussiones Mathematicae Graph Theory,41 (2021) 531–558. (SCI检索号：000604457200013) [PDF]
66.Xin Zhang,List Edge Coloring of Outer-1-planar Graphs,Acta Mathematicae Applicatae Sinica, English Series, 36 (2020) 737–752.(SCI检索号：000565769700017)[PDF]中国数学会T2
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)(EI检索号：20203509097918)[PDF]
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)(EI检索号：20203509097579)[PDF]
63. Bei Niu,Xin Zhang*, Yuping Gao, Equitable partition of plane graphs with independent crossings into induced forests,Discrete Mathematics, 343(5) (2020) #111792. (SCI检索号：000528201500026) [PDF]中国数学会T2西电2类贡献度
62.Xin Zhang, Bei Niu, Equitable partition of graphs into induced linear forests,Journal of Combinatorial Optimization, 39(2) (2020) 581-588. (SCI检索号：000511607600015) [PDF]中国数学会T2
61. Bi Li,Xin Zhang, Tree-coloring problems of bounded treewidth graphs,Journal of Combinatorial Optimization, 39(1) (2020) 156-169. (SCI检索号：000491477400004) [PDF]中国数学会T2
60. Bei Niu,Xin Zhang*, Light edges in 1-planar graphs of minimum degree 3,Discrete Mathematics, 343(2) (2020) #111664. (SCI检索号：000504780200020) [PDF]中国数学会T2西电2类贡献度
59. Bei Niu,Xin Zhang*, Linear arboricity of NIC-planar graphs,Acta Mathematicae Applicatae Sinica, English Series, 35(4) (2019) 924–934. (SCI检索号：000511666400020)[PDF]中国数学会T2
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. (SCI检索号：000464869700008)[PDF]中国数学会T3
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. (SCI检索号：000457694300012)[PDF]西电2类贡献度
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. (SCI检索号：000434257100013)[PDF]
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. (SCI检索号：000435045200018)[PDF]西电2类贡献度
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. (SCI检索号：000431029600013)[PDF]中国数学会T2
53. Weichan Liu, Chen Gong, Lifang Wu,Xin Zhang*, A note on the vertex arboricity of signed graphs,Utilitas Mathematica, 106 (2018) 251-258. (SCI检索号：000426620100019)[PDF]
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. (EI检索号：20180504695243)[PDF]
51.Xin Zhang, Total coloring of outer-1-planar graphs with near-independent crossings,Journal of Combinatorial Optimization, 34(3) (2017) 661-675.(SCI检索号：000411586300001)[PDF]中国数学会T2
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. (SCI检索号：000404229200024)[PDF]中国数学会T3
49. Jiaqiang Ma, Renfeng Zhou, Xue Deng, Chenggang Wang,Xin Zhang*, on r-equitable colorings of bipartite graphs,Utilitas Mathematica, 103 (2017) 161-165. (SCI检索号：000401308200012)[PDF]
48.Xin Zhang, List vertex arboricity of graphs without forbidden minors,Ars Combinatoria, 133 (2017) 349-353. (SCI检索号：000404082800025)[PDF]
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. (SCI检索号：000392817300018)[PDF]中国数学会T2
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. (SCI检索号：000379033200012)[PDF]中国数学会T2
45.Xin Zhang, On equitable colorings of sparse graphs,Bulletin of the Malaysian Mathematical Sciences Society, 39(1) (2016) 257-268. (SCI检索号：000377531700019)[PDF]
44.Xin Zhang, Equitable list point arboricity of graphs,Filomat, 30(2) (2016) 373-378. (SCI检索号：000376573900013)[PDF]
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. (SCI检索号：000372282300005)[PDF]中国数学会T2
42.Xin Zhang, Equitable vertex arboricity of subcubic graphs,Discrete Mathematics, 339 (2016) 1724-1726. (SCI检索号：000374354400012)[PDF]中国数学会T2西电2类贡献度
41.Xin Zhang, The edge chromatic number of outer-1-planar graphs,Discrete Mathematics, 339 (2016) 1393-1399. (SCI检索号：000369467500025)[PDF]中国数学会T2西电2类贡献度
40.Xin Zhang, Jianfeng Hou, Guizhen Liu, On total coloring of 1-planar graphs,Journal of Combinatorial Optimization, 30(1) (2015) 160-173. (SCI检索号：000355630900013)[PDF]中国数学会T2
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. (SCI检索号：000352114300003)[PDF]中国数学会T2
38. Jingjing Tian,Xin Zhang*, Light triangles in plane graphs with near-independent crossings,Utilitas Mathematica, 97 (2015), 399-405. (SCI检索号：000355784000030)[PDF]
37. Zhidan Yan, Wei Wang,Xin Zhang*, Equitable colorings of Cartesian products with balanced complete multipartite graphs,Discrete Applied Mathematics,180 (2015) 200-203. (SCI检索号：000346545500023)[PDF]中国数学会T3西电2类贡献度
36.Xin Zhang, Equitable vertex arboricity of planar graphs,Taiwanese Journal of Mathematics, 19(1) (2015) 123-131. (SCI检索号：000348590700008)[PDF]
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. (SCI检索号：000339698800017)[PDF]中国数学会T3西电2类贡献度
34.Xin Zhang, Drawing complete multipartite graphs on the plane with restrictions on crossings,Acta Mathematica Sinica, English Series, 30(12) (2014) 2045-2053. (SCI检索号：000344832600004)[PDF]中国数学会T1
33.Xin Zhang, Light 3-cycles in 1-planar graphs with degree restrictions,Bulletin of the Korean Mathematical Society, 51(2) (2014) 511-517. (SCI检索号：000334569900016)[PDF]
32.Xin Zhang, A note one the weight of triangle in 1-planar graphs with minimum degree 6,Utilitas Mathematica, 93 (2014) 129-134. (SCI检索号：000332188500010)[PDF]
31.Xin Zhang, Jian-Liang Wu, A conjecture on equitable vertex arboricity of graphs,Filomat28(1) (2014) 217-219. (SCI检索号：000331996600022)[PDF]
30. Jingjing Tian,Xin Zhang*, Pseudo-outerplanar graphs and chromatic conjectures,Ars Combinatoria, 114 (2014) 353-361. (SCI检索号：000333065300035)[PDF]
29.Xin Zhang, Guizhen Liu, On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree,Ars Mathematica Contemporanea7(2) (2014) 233-243. (SCI检索号：000346150500003)[PDF]
28. Jian-Liang Wu,Xin Zhang, Hailun Li, Equitable vertex arboricity of graphs,Discrete Mathematics, 313 (2013) 2696-2701. (SCI检索号：000326133900004)[PDF]中国数学会T2西电2类贡献度
27.Xin Zhang, List total coloring of pseudo-outerplanar graphs,Discrete Mathematics313 (2013) 2297-2306. (SCI检索号：000323867400030)[PDF]中国数学会T2西电2类贡献度
26.Xin Zhang, Guizhen Liu, Group edge choosability of planar graphs without adjacent short cycles,Acta Mathematica Sinica, English Series29(11) (2013) 2079-2086. (SCI检索号：000325418300005)[PDF]中国数学会T1
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 Society88(3) (2013) 353-358. (SCI检索号：000328203100001)[PDF]
24.Xin Zhang, Guizhen Liu, The structure of plane graphs with independent crossings and its appications to coloring problems,Central European Journal of Mathematics11(2) (2013) 308-321. (SCI检索号：000311495900009)[PDF]
23.Xin Zhang, Guizhen Liu, On edge colorings of 1-toroidal graphs,Acta Mathematica Sinica, English Series29(7) (2013) 1421-1428. (SCI检索号：000320661200014)[PDF]中国数学会T1
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. (SCI检索号：000312720300014)[PDF]
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 Society35(4) (2012) 897-910. (SCI检索号：000308779700007)[PDF]
20.Xin Zhang, Guizhen Liu, Yong Yu, On (p,1)-total labelling of plane graphs with independent crossings,Filomat26(6) (2012) 1091-1100. (SCI检索号：000322026300002)[PDF]
19.Xin Zhang, Jian-Liang Wu, Guizhen Liu, List edge and list total coloring of 1-planar graphs,Frontiers of Mathematics in China7(5) (2012) 1005-1018. (SCI检索号：000308355600014)[PDF]中国数学会T2
18.Xin Zhang, Guizhen Liu, On edge colorings of 1-planar graphs without adjacent triangles,Information Processing Letters112 (2012) 138-142. (SCI检索号：000300482800007)[PDF]
17.Xin Zhang, Guizhen Liu, Jian-Liang Wu, k-forested choosability of planar graphs and of sparse graphs,Discrete Mathematics312 (2012) 999-1005. (SCI检索号：000300758300019)[PDF]中国数学会T2
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. (SCI检索号：000304093000005)[PDF]中国数学会T1
15. Aijun Dong, Xiang Tan,Xin Zhang, Guojun Li, Equitable coloring and equitable choosability of planar graphs without 6- and 7-cycles,Ars Combinatoria103 (2012) 333-352. (SCI检索号：000298767700028)[PDF]
14.Xin Zhang, Guizhen Liu, On edge colorings of 1-planar graphs without chordal 5-cycles,Ars Combinatoria104 (2012) 431-436. (SCI检索号：000302035100036)[PDF]
13.Xin Zhang, Guanghui Wang, Yong Yu, Jinbo Li, Guizhen Liu, On r-acyclic edge colorings of planar graphs,Discrete Applied Mathematics160 (2012) 2048-2053. (SCI检索号：000306298600016)[PDF]
12.Xin Zhang, Guizhen Liu, Jian-Liang Wu, (1, λ)-embedded graphs and the acyclic edge choosability,Bulletin of the Korean Mathematical Society49(3)(2012) 573-580. (SCI检索号：000304975900009)[PDF]中国数学会T3
11.Xin Zhang, Guizhen Liu, Jian-Liang Wu, Edge covering pseudo-outerplanar graphs with forests,Discrete Mathematics312 (2012) 2788-2799. (SCI检索号：000307620500005)[PDF]中国数学会T2
10.Xin Zhang, Jian-Liang Wu, On edge colorings of 1-planar graphs,Information Processing Letters111 (2011) 124-128. (SCI检索号：000286557600006)[PDF]
9.Xin Zhang, Jian-Liang Wu, On equitable and equitable list colorings of series-parallel graphs,Discrete Mathematics311 (2011) 800–803. (SCI检索号：000290008300003)[PDF]中国数学会T2
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 Letters111 (2011) 1062-1066. (SCI检索号：000296990400007)[PDF]
7.Xin Zhang, Yong Yu, Guizhen Liu, On (p,1)-total labelling of 1-planar graphs,Central European Journal of Mathematics9(6) (2011) 1424-1434. (SCI检索号：000297868700020)[PDF]
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 Science13(3) (2011) 9-16. (SCI检索号：000297927800002)[PDF]
5.Xin Zhang, Guizhen Liu, Jian-Liang Wu, On the linear arboricity of 1-planar graphs,OR Transactions15(3) (2011) 38-44.[PDF]中国数学会T3
4. Yong Yu,Xin Zhang, Guizhen Liu. List (d,1)-total labelling of graphs em[ant]bedded in surfaces,OR Transactions15(3) (2011) 29-37.[PDF]中国数学会T3
3.Xin Zhang, Jian-Liang Wu, Jin Yan, Degree conditions for the partition of a graph into triangles and quadrilaterals,Utilitas Mathmatica86 (2011) 341-346. (SCI检索号：000296405900030)[PDF]
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. (SCI检索号：000288776800002)[PDF]
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 Mathematics310 (2010) 2499-2503. (SCI检索号：000280945000005)[PDF]中国数学会T2
11. 张欣, 李艳, 稀疏图与系列平行图的列表动态染色,应用数学学报，45(4) (2022) 552-559. [PDF]中国数学会T3西电2类贡献度
10. 张华强, 张欣, 牛蓓，三类超越可平面图的结构及其约束数，应用数学学报，44(6) (2021) 838-846. [PDF]中国数学会T3西电2类贡献度
9.张欣,2-可平面图的交叉数及其应用，数学学报， 64(3) (2021) 463-470. [PDF]中国数学会T3
8. 牛蓓,张欣,反d-退化图中的点不交3-圈,山东大学学报（理学版）, 55(9) (2020) 51-53.[PDF]
7. 李艳,张欣,外1-平面图的均匀边染色，计算机工程与应用，55(24) (2019) 37-40. [PDF]
6. 宫辰，武丽芳，刘维婵，张欣, 不含特殊子式的符号图的选择数,计算机工程与应用，54(16) (2018) 55-58. [PDF]
5. 刘维婵,张欣,外1-平面图的均匀点荫度，计算机工程与应用，54(10) (2018) 51-53. [PDF]
4.张欣，刘维婵，1-平面图及其子类的染色，运筹学学报，21(4) (2017) 135-152.[PDF]中国数学会T3西电2类贡献度
3.张欣, 徐兰, 刘桂真, 稀疏图的k-森林染色,山东大学学报（理学版）, 46(4) (2011) 1-3.[PDF]
2.张欣, 刘桂真, 吴建良, 不含3-圈的1-平面图的边染色,山东大学学报（理学版）, 45(6) (2010) 15-17.[PDF]
1.张欣, 刘桂真, 吴建良, 1-平面图的结构性质及其在无圈边染色上的应用,中国科学：数学, 40 (2010) 1025-1032.[PDF]中国数学会T3