Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarXuding Zhu
朱緒鼎
Person information
- unicode name: 朱緒鼎
- affiliation: Zhejiang Normal University, China
- affiliation: National Sun Yat-sen University, Kaohsiung, Department of Applied Mathematics
- affiliation: Simon Fraser University, Burnaby, School of Computing Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j214]Laihao Ding, Guan-Huei Duh, Guanghui Wang, Tsai-Lien Wong, Jianliang Wu, Xiaowei Yu, Xuding Zhu:
Graphs are (1, Δ+1)-choosable. Discrete Mathematics 342(1): 279-284 (2019)- [j213]Yiting Jiang, Daphne Der-Fen Liu, Yeong-Nan Yeh, Xuding Zhu:
Colouring of generalized signed triangle-free planar graphs. Discrete Mathematics 342(3): 836-843 (2019) - [j212]Genghua Fan, Hongbi Jiang, Ping Li, Douglas B. West, Daqing Yang, Xuding Zhu:
Extensions of matroid covering and packing. Eur. J. Comb. 76: 117-122 (2019) - [j211]
- 2018
- [j210]Grzegorz Gutowski, Ming Han, Tomasz Krawczyk, Xuding Zhu:
Defective 3-Paintability of Planar Graphs. Electr. J. Comb. 25(2): P2.34 (2018) - [j209]Hao Qi, Xuding Zhu:
The fault-diameter and wide-diameter of twisted hypercubes. Discrete Applied Mathematics 235: 154-160 (2018) - [j208]Rongxing Xu, Yeong-Nan Yeh, Xuding Zhu:
List colouring of graphs and generalized Dyck paths. Discrete Mathematics 341(3): 810-819 (2018) - [j207]Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu:
Graphs with maximum average degree less than 114 are (1, 3)-choosable. Discrete Mathematics 341(10): 2661-2671 (2018) - [j206]Yu-Chang Liang, Yunfang Tang, Tsai-Lien Wong, Xuding Zhu:
Total list weighting of graphs with bounded maximum average degree. Discrete Mathematics 341(10): 2672-2675 (2018) - [j205]Andrzej Dudek, Xavier Pérez-Giménez, Pawel Pralat, Hao Qi, Douglas B. West, Xuding Zhu:
Randomly twisted hypercubes. Eur. J. Comb. 70: 364-373 (2018) - [j204]
- [j203]Jørgen Bang-Jensen, Jing Huang, Xuding Zhu:
Completing orientations of partially oriented graphs. Journal of Graph Theory 87(3): 285-304 (2018) - [j202]
- 2017
- [j201]Tsai-Lien Wong, Xuding Zhu:
Permanent Index of Matrices Associated with Graphs. Electr. J. Comb. 24(1): P1.25 (2017) - [j200]
- [j199]Balázs Keszegh, Xuding Zhu:
Choosability and paintability of the lexicographic product of graphs. Discrete Applied Mathematics 223: 84-90 (2017) - [j198]Yunfang Tang, Xuding Zhu:
Total weight choosability of graphs with bounded maximum average degree. Discrete Mathematics 340(8): 2033-2042 (2017) - [j197]Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu:
DP-colorings of graphs with high chromatic number. Eur. J. Comb. 65: 122-129 (2017) - [j196]Yunfang Tang, Xuding Zhu:
Total weight choosability of Mycielski graphs. J. Comb. Optim. 33(1): 165-182 (2017) - [j195]Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu:
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. J. Comb. Theory, Ser. B 122: 741-756 (2017) - [j194]
- [j193]Jixian Meng, Gregory J. Puleo, Xuding Zhu:
On (4, 2)-Choosable Graphs. Journal of Graph Theory 85(2): 412-428 (2017) - [j192]
- [j191]Gerard Jennhwa Chang, Guan-Huei Duh, Tsai-Lien Wong, Xuding Zhu:
Total Weight Choosability of Trees. SIAM J. Discrete Math. 31(2): 669-686 (2017) - 2016
- [j190]
- [j189]Yaling Zhong, Xuding Zhu:
Fractional Thue chromatic number of graphs. Discrete Applied Mathematics 200: 191-199 (2016) - [j188]Cheyu Lin, Xuding Zhu:
Circular total chromatic numbers of graphs. Discrete Mathematics 339(2): 857-865 (2016) - [j187]Ming Han, Xuding Zhu:
Locally planar graphs are 2-defective 4-paintable. Eur. J. Comb. 54: 35-50 (2016) - [j186]Andreas M. Hinz, S. Arumugam, Rangaswami Balakrishnan, S. Francis Raj, T. Karthick, K. Somasundaram, Xuding Zhu:
Preface. Electronic Notes in Discrete Mathematics 53: 1-2 (2016) - [j185]Yunfang Tang, Tsai-Lien Wong, Xuding Zhu:
Total Weight Choosability of Cone Graphs. Graphs and Combinatorics 32(3): 1203-1216 (2016) - [j184]Huanhua Zhao, Xuding Zhu:
(2+ϵ)-Nonrepetitive List Colouring of Paths. Graphs and Combinatorics 32(4): 1635-1640 (2016) - [j183]Daphne Der-Fen Liu, Xuding Zhu:
A combinatorial proof for the circular chromatic number of Kneser graphs. J. Comb. Optim. 32(3): 765-774 (2016) - [j182]Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu:
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions. Journal of Graph Theory 81(4): 403-413 (2016) - [j181]Fei-Huang Chang, Yu-Chang Liang, Zhishi Pan, Xuding Zhu:
Antimagic Labeling of Regular Graphs. Journal of Graph Theory 82(4): 339-349 (2016) - [j180]Daqing Yang, Xuding Zhu:
Strong Chromatic Index of Sparse Graphs. Journal of Graph Theory 83(4): 334-339 (2016) - [j179]Zhao Zhang, James Willson, Zaixin Lu, Weili Wu, Xuding Zhu, Ding-Zhu Du:
Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks. IEEE/ACM Trans. Netw. 24(6): 3620-3633 (2016) - 2015
- [j178]Robert Lukot'ka, Ján Mazák, Xuding Zhu:
Maximum 4-Degenerate Subgraph of a Planar Graph. Electr. J. Comb. 22(1): P1.11 (2015) - [j177]Thomas Mahoney, Jixian Meng, Xuding Zhu:
Characterization of $(2m, m)$-Paintable Graphs. Electr. J. Comb. 22(2): P2.14 (2015) - [j176]Cheyu Lin, Tsai-Lien Wong, Xuding Zhu:
Circular chromatic indices of even degree regular graphs. Discrete Mathematics 338(7): 1154-1162 (2015) - [j175]Ming Han, Xuding Zhu:
Locally planar graphs are 5-paintable. Discrete Mathematics 338(10): 1740-1749 (2015) - [j174]Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu:
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. Eur. J. Comb. 43: 295-305 (2015) - [j173]
- [j172]Xuding Zhu:
Circular flow number of highly edge connected signed graphs. J. Comb. Theory, Ser. B 112: 93-103 (2015) - [j171]Daniel W. Cranston, Yu-Chang Liang, Xuding Zhu:
Regular Graphs of Odd Degree Are Antimagic. Journal of Graph Theory 80(1): 28-33 (2015) - [i5]Jørgen Bang-Jensen, Jing Huang, Xuding Zhu:
Completing orientations of partially oriented graphs. CoRR abs/1509.01301 (2015) - 2014
- [j170]Yuehua Bu, Stephen Finbow, Daphne Der-Fen Liu, Xuding Zhu:
List backbone colouring of graphs. Discrete Applied Mathematics 167: 45-51 (2014) - [j169]Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu:
Anti-magic labeling of trees. Discrete Mathematics 331: 9-14 (2014) - [j168]Balázs Keszegh, Balázs Patkós, Xuding Zhu:
Nonrepetitive colorings of lexicographic product of graphs. Discrete Mathematics & Theoretical Computer Science 16(2): 97-110 (2014) - [j167]Jakub Kozik, Piotr Micek, Xuding Zhu:
Towards an on-line version of Ohba's conjecture. Eur. J. Comb. 36: 110-121 (2014) - [j166]Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu:
Erratum to "Application of polynomial method to on-line list colouring of graphs" [European J. Combin. 33(2012) 872-883]. Eur. J. Comb. 38: 23 (2014) - [j165]Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu:
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs. Eur. J. Comb. 42: 26-48 (2014) - [j164]Jaroslav Nesetril, Patrice Ossona de Mendez, Xuding Zhu:
Colouring edges with many colours in cycles. J. Comb. Theory, Ser. B 109: 102-119 (2014) - [j163]Yu-Chang Liang, Xuding Zhu:
Antimagic Labeling of Cubic Graphs. Journal of Graph Theory 75(1): 31-36 (2014) - [j162]Cheyu Lin, Tsai-Lien Wong, Xuding Zhu:
Circular Chromatic Indices of Regular Graphs. Journal of Graph Theory 76(3): 169-193 (2014) - [c3]Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu:
Lower Bounds for On-line Graph Colorings. ISAAC 2014: 507-515 - [i4]Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu:
Lower bounds for on-line graph colorings. CoRR abs/1404.7259 (2014) - 2013
- [j161]Wai Hong Chan, Wai Chee Shiu, Pak Kiu Sun, Xuding Zhu:
The strong game colouring number of directed graphs. Discrete Mathematics 313(10): 1070-1077 (2013) - [j160]Yuehua Bu, Daphne Der-Fen Liu, Xuding Zhu:
Backbone coloring for graphs with large girths. Discrete Mathematics 313(18): 1799-1804 (2013) - [j159]Jonathan A. Noel, Bruce A. Reed, Douglas B. West, Hehui Wu, Xuding Zhu:
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond. Electronic Notes in Discrete Mathematics 43: 89-95 (2013) - [j158]D. J. Guan, Ko-Wei Lih, Xuding Zhu:
Preface: optimization in graphs. J. Comb. Optim. 25(4): 499-500 (2013) - [j157]
- [j156]Gerard Jennhwa Chang, Daphne Der-Fen Liu, Xuding Zhu:
A short proof for Chen's Alternative Kneser Coloring Lemma. J. Comb. Theory, Ser. A 120(1): 159-163 (2013) - [j155]Tsai-Lien Wong, Xuding Zhu:
Partial Online List Coloring of Graphs. Journal of Graph Theory 74(3): 359-367 (2013) - [j154]Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Hehui Wu, Xuding Zhu:
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree. Journal of Graph Theory 74(4): 369-391 (2013) - [j153]Yu-Chang Liang, Xuding Zhu:
Anti-magic labelling of Cartesian product of graphs. Theor. Comput. Sci. 477: 1-5 (2013) - [i3]Robert Lukotka, Ján Mazák, Xuding Zhu:
Maximum 4-degenerate subgraph of a planar graph. CoRR abs/1305.6195 (2013) - [i2]Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu:
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. CoRR abs/1308.6739 (2013) - 2012
- [j152]Seog-Jin Kim, Young Soo Kwon, Daphne Der-Fen Liu, Xuding Zhu:
On-Line List Colouring of Complete Multipartite Graphs. Electr. J. Comb. 19(1): P41 (2012) - [j151]R. Balakrishnan, R. B. Bapat, Sandi Klavzar, Ambat Vijayakumar, Thomas Zaslavsky, Xuding Zhu:
Preface. Discrete Mathematics 312(9): 1493 (2012) - [j150]Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu:
Weighted-1-antimagic graphs of prime power order. Discrete Mathematics 312(14): 2162-2169 (2012) - [j149]Hal A. Kierstead, Chung-Ying Yang, Daqing Yang, Xuding Zhu:
Adapted game colouring of graphs. Eur. J. Comb. 33(4): 435-445 (2012) - [j148]Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu:
Application of polynomial method to on-line list colouring of graphs. Eur. J. Comb. 33(5): 872-883 (2012) - [j147]Tsai-Lien Wong, Jiaojiao Wu, Xuding Zhu:
Total weight choosability of Cartesian product of graphs. Eur. J. Comb. 33(8): 1725-1738 (2012) - [j146]Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu:
Decomposing a graph into forests. J. Comb. Theory, Ser. B 102(1): 38-52 (2012) - [j145]Tsai-Lien Wong, Xuding Zhu:
Antimagic labelling of vertex weighted graphs. Journal of Graph Theory 70(3): 348-350 (2012) - [j144]Jiangxu Kong, Weifan Wang, Xuding Zhu:
The surviving rate of planar graphs. Theor. Comput. Sci. 416: 65-70 (2012) - 2011
- [j143]Xuding Zhu:
Graphs with chromatic numbers strictly less than their colouring numbers. Ars Math. Contemp. 4(1): 25-27 (2011) - [j142]Ákos Seress, Tsai-Lien Wong, Xuding Zhu:
Distinguishing labeling of the actions of almost simple groups. Combinatorica 31(4): 489-506 (2011) - [j141]Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez, Xuding Zhu:
Thue choosability of trees. Discrete Applied Mathematics 159(17): 2045-2049 (2011) - [j140]Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu:
Acyclic 4-choosability of planar graphs. Discrete Mathematics 311(1): 92-101 (2011) - [j139]Xuding Zhu:
The fractional version of Hedetniemi's conjecture is true. Eur. J. Comb. 32(7): 1168-1175 (2011) - [j138]André Raspaud, Xuding Zhu:
Circular flow on signed graphs. J. Comb. Theory, Ser. B 101(6): 464-479 (2011) - [j137]Weifan Wang, Xuding Zhu:
Entire colouring of plane graphs. J. Comb. Theory, Ser. B 101(6): 490-501 (2011) - [j136]Tsai-Lien Wong, Xuding Zhu:
Total weight choosability of graphs. Journal of Graph Theory 66(3): 198-212 (2011) - [j135]Daphne Der-Fen Liu, Serguei Norine, Zhishi Pan, Xuding Zhu:
Circular consecutive choosability of k-choosable graphs. Journal of Graph Theory 67(3): 178-197 (2011) - [j134]Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu:
Short cycle covers of graphs and nowhere-zero flows. Journal of Graph Theory 68(4): 340-348 (2011) - [j133]Jaroslaw Grytczuk, Jakub Przybylo, Xuding Zhu:
Nonrepetitive list colourings of paths. Random Struct. Algorithms 38(1-2): 162-173 (2011) - [j132]Weifan Wang, Xubin Yue, Xuding Zhu:
The surviving rate of an outerplanar graph for the firefighter problem. Theor. Comput. Sci. 412(8-10): 913-921 (2011) - [c2]Ross Churchley, Jing Huang, Xuding Zhu:
Complexity of Cycle Transverse Matching Problems. IWOCA 2011: 135-143 - [e1]Weifan Wang, Xuding Zhu, Ding-Zhu Du:
Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings. Lecture Notes in Computer Science 6831, Springer 2011, ISBN 978-3-642-22615-1 [contents] - [i1]
- 2010
- [j131]
- [j130]Gerard J. Chang, Jiaojiao Wu, Xuding Zhu:
Rainbow domination on trees. Discrete Applied Mathematics 158(1): 8-12 (2010) - [j129]Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu:
Decomposition of sparse graphs, with application to game coloring number. Discrete Mathematics 310(10-11): 1520-1523 (2010) - [j128]Nicolas Roussel, Xuding Zhu:
Total coloring of planar graphs of maximum degree eight. Inf. Process. Lett. 110(8-9): 321-324 (2010) - [j127]Mickaël Montassier, André Raspaud, Xuding Zhu:
Decomposition of sparse graphs into two forests, one having bounded maximum degree. Inf. Process. Lett. 110(20): 913-916 (2010) - [j126]Wensong Lin, Daphne Der-Fen Liu, Xuding Zhu:
Multi-coloring the Mycielskian of graphs. Journal of Graph Theory 63(4): 311-323 (2010) - [j125]Leizhen Cai, Weifan Wang, Xuding Zhu:
Choosability of toroidal graphs without short cycles. Journal of Graph Theory 65(1): 1-15 (2010) - [j124]Arnaud Pêcher, Xuding Zhu:
Claw-free circular-perfect graphs. Journal of Graph Theory 65(2): 163-172 (2010) - [j123]Zhishi Pan, Xuding Zhu:
Multiple Coloring of Cone Graphs. SIAM J. Discrete Math. 24(4): 1515-1526 (2010)
2000 – 2009
- 2009
- [j122]
- [j121]Xuding Zhu:
Bipartite density of triangle-free subcubic graphs. Discrete Applied Mathematics 157(4): 710-714 (2009) - [j120]Tsai-Lien Wong, Xuding Zhu:
Distinguishing labeling of group actions. Discrete Mathematics 309(6): 1760-1765 (2009) - [j119]Hungyung Chang, Xuding Zhu:
Colouring games on outerplanar graphs and trees. Discrete Mathematics 309(10): 3185-3196 (2009) - [j118]Wensong Lin, Xuding Zhu:
Circular game chromatic number of graphs. Discrete Mathematics 309(13): 4495-4501 (2009) - [j117]Louis Esperet, Xuding Zhu:
Game colouring of the square of graphs. Discrete Mathematics 309(13): 4514-4521 (2009) - [j116]Xuding Zhu:
Colouring graphs with bounded generalized colouring number. Discrete Mathematics 309(18): 5562-5568 (2009) - [j115]Albert Guan, Xuding Zhu:
Adaptable choosability of planar graphs with sparse short cycles. Discrete Mathematics 309(20): 6044-6047 (2009) - [j114]Pavol Hell, Zhishi Pan, Tsai-Lien Wong, Xuding Zhu:
Adaptable chromatic number of graph products. Discrete Mathematics 309(21): 6153-6159 (2009) - [j113]Mickaël Montassier, André Raspaud, Xuding Zhu:
An upper bound on adaptable choosability of graphs. Eur. J. Comb. 30(2): 351-355 (2009) - [j112]Xuding Zhu:
Bipartite subgraphs of triangle-free subcubic graphs. J. Comb. Theory, Ser. B 99(1): 62-83 (2009) - [j111]Louis Esperet, Mickaël Montassier, Xuding Zhu:
Adapted list coloring of planar graphs. Journal of Graph Theory 62(2): 127-138 (2009) - [j110]Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu:
The Two-Coloring Number and Degenerate Colorings of Planar Graphs. SIAM J. Discrete Math. 23(3): 1548-1560 (2009) - [j109]Hamed Hatami, Xuding Zhu:
The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three. SIAM J. Discrete Math. 23(4): 1762-1775 (2009) - 2008
- [j108]
- [j107]Jiaojiao Wu, Xuding Zhu:
Lower bounds for the game colouring number of partial k-trees and planar graphs. Discrete Mathematics 308(12): 2637-2642 (2008) - [j106]Daphne Der-Fen Liu, Xuding Zhu:
Coloring the Cartesian sum of graphs. Discrete Mathematics 308(24): 5928-5936 (2008) - [j105]Jiaojiao Wu, Xuding Zhu:
The 6-relaxed game chromatic number of outerplanar graphs. Discrete Mathematics 308(24): 5974-5980 (2008) - [j104]Pavol Hell, Xuding Zhu:
On the adaptable chromatic number of graphs. Eur. J. Comb. 29(4): 912-921 (2008) - [j103]Zhishi Pan, Xuding Zhu:
Minimal circular-imperfect graphs of large clique number and large independence number. Eur. J. Comb. 29(4): 1055-1063 (2008) - [j102]Daqing Yang, Xuding Zhu:
Activation strategy for asymmetric marking games. Eur. J. Comb. 29(5): 1123-1132 (2008) - [j101]Daphne Der-Fen Liu, Xuding Zhu:
Fractional chromatic number of distance graphs generated by two-interval sets. Eur. J. Comb. 29(7): 1733-1743 (2008) - [j100]Xuding Zhu:
Refined activation strategy for the marking game. J. Comb. Theory, Ser. B 98(1): 1-18 (2008) - [j99]Douglas B. West, Xuding Zhu:
Circular chromatic index of Cartesian products of graphs. Journal of Graph Theory 57(1): 7-18 (2008) - [j98]Serguei Norine, Tsai-Lien Wong, Xuding Zhu:
Circular choosability via combinatorial Nullstellensatz. Journal of Graph Theory 59(3): 190-204 (2008) - [j97]Xuding Zhu:
Game coloring the Cartesian product of graphs. Journal of Graph Theory 59(4): 261-278 (2008) - [j96]Alexandr V. Kostochka, Xuding Zhu:
Adapted List Coloring of Graphs and Hypergraphs. SIAM J. Discrete Math. 22(1): 398-408 (2008) - 2007
- [j95]Sandi Klavzar, Xuding Zhu:
Cartesian powers of graphs can be distinguished by two labels. Eur. J. Comb. 28(1): 303-310 (2007) - [j94]Arnaud Pêcher, Xuding Zhu:
Claw-free circular-perfect graphs. Electronic Notes in Discrete Mathematics 29: 451-455 (2007) - [j93]
- [j92]