A simple proof of the multiplicativity of directed cycles of prime power length. - Xuding Zhu (Discret. Appl. Math., 1992)

Star chromatic numbers and products of graphs. - Xuding Zhu (J. Graph Theory, 1992)

Homomorphisms to oriented cycles. - Pavol Hell; Huishan Zhou; Xuding Zhu (Comb., 1993)

Homomorphisms to oriented paths. - Pavol Hell; Xuding Zhu (Discret. Math., 1994)

Multiplicativity of Oriented Cycles. - Pavol Hell; Huishan Zhou; Xuding Zhu (J. Comb. Theory B, 1994)

Ramsey Families which Exclude a Graph. - Vojtech Rödl; Norbert Sauer; Xuding Zhu (Comb., 1995)

A Polynomial Algorithm for Homomorphisms to Oriented Cycles. - Xuding Zhu (J. Algorithms, 1995)

On homomorphisms to acyclic local tournaments. - Pavol Hell; Huishan Zhou; Xuding Zhu (J. Graph Theory, 1995)

The Existence of Homomorphisms to Oriented Cycles. - Pavol Hell; Xuding Zhu (SIAM J. Discret. Math., 1995)

Star Chromatic Numbers of Graphs. - Eckhard Steffen; Xuding Zhu (Comb., 1996)

Complexity of Tree Homomorphisms. - Pavol Hell; Jaroslav Nesetril; Xuding Zhu (Discret. Appl. Math., 1996)

Star-extremal graphs and the lexicographic product. - Guogang Gao; Xuding Zhu (Discret. Math., 1996)

On the bounds for the ultimate independence ratio of a graph. - Xuding Zhu (Discret. Math., 1996)

Circular colorings of weighted graphs. - Walter A. Deuber; Xuding Zhu (J. Graph Theory, 1996)

On bounded treewidth duality of graphs. - Jaroslav Nesetril; Xuding Zhu (J. Graph Theory, 1996)

Uniquely H-colorable graphs with large girth. - Xuding Zhu (J. Graph Theory, 1996)

A note on graph reconstruction. - Xuding Zhu (Ars Comb., 1997)

Multiplicativity of Acyclic Local Tournaments. - Huishan Zhou; Xuding Zhu (Comb., 1997)

The chromatic numbers of distance graphs. - Walter A. Deuber; Xuding Zhu (Discret. Math., 1997)

A Coloring Problem for Weighted Graphs. - D. J. Guan; Xuding Zhu (Inf. Process. Lett., 1997)

Acyclic and oriented chromatic numbers of graphs. - Alexandr V. Kostochka; Éric Sopena; Xuding Zhu (J. Graph Theory, 1997)

Chromatic Ramsey numbers. - Xuding Zhu (Discret. Math., 1998)

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs. - Gerard J. Chang; Lingling Huang; Xuding Zhu (Eur. J. Comb., 1998)

Relaxed Coloring of a Graph. - Walter A. Deuber; Xuding Zhu (Graphs Comb., 1998)

Minimal Oriented Graphs of Diameter 2. - Zoltán Füredi; Peter Horák; Chandra M. Pareek; Xuding Zhu (Graphs Comb., 1998)

Pattern Periodic Coloring of Distance Graphs. - Xuding Zhu (J. Comb. Theory B, 1998)

Oriented walk double covering and bidirectional double tracing. - Hongbing Fan; Xuding Zhu (J. Graph Theory, 1998)

Multiple Capacity Vehicle Routing on Paths. - D. J. Guan; Xuding Zhu (SIAM J. Discret. Math., 1998)

Graphs Whose Circular Chromatic Number Equals the Chromatic Number. - Xuding Zhu (Comb., 1999)

Circular chromatic numbers of Mycielski's graphs. - Gerard J. Chang; Lingling Huang; Xuding Zhu (Discret. Math., 1999)

A bound for the game chromatic number of graphs. - Thomas Dinski; Xuding Zhu (Discret. Math., 1999)

Distance Graphs and T-Coloring. - Gerard J. Chang; Daphne Der-Fen Liu; Xuding Zhu (J. Comb. Theory B, 1999)

Planar Graphs with Circular Chromatic Numbers between 3 and 4. - Xuding Zhu (J. Comb. Theory B, 1999)

The Game Coloring Number of Planar Graphs. - Xuding Zhu (J. Comb. Theory B, 1999)

Game chromatic number of outerplanar graphs. - D. J. Guan; Xuding Zhu (J. Graph Theory, 1999)

Distance graphs with missing multiples in the distance sets. - Daphne Der-Fen Liu; Xuding Zhu (J. Graph Theory, 1999)

Construction of uniquely H-colorable graphs. - Xuding Zhu (J. Graph Theory, 1999)

A simple proof of Moser's theorem. - Xuding Zhu (J. Graph Theory, 1999)

Star Extremal Circulant Graphs. - Ko-Wei Lih; Daphne Der-Fen Liu; Xuding Zhu (SIAM J. Discret. Math., 1999)

Pseudo-Hamiltonian-connected graphs. - Gerard J. Chang; Xuding Zhu (Discret. Appl. Math., 2000)

The game coloring number of pseudo partial k-trees. - Xuding Zhu (Discret. Math., 2000)

The circular chromatic number of series-parallel graphs with large girth. - Chihyun Chien; Xuding Zhu (J. Graph Theory, 2000)

The circular chromatic number of series-parallel graphs. - Pavol Hell; Xuding Zhu (J. Graph Theory, 2000)

Perfect Graphs for Generalized Colouring-Circular Perfect Graphs. - Xuding Zhu (Graphs, Morphisms and Statistical Physics, 2001)

Circular Chromatic Number of Planar Graphs of Large Odd Girth. - Xuding Zhu (Electron. J. Comb., 2001)

Construction of sparse graphs with prescribed circular colorings. - Jaroslav Nesetril; Xuding Zhu (Discret. Math., 2001)

Circular chromatic number: a survey. - Xuding Zhu (Discret. Math., 2001)

Game chromatic index of k-degenerate graphs. - Leizhen Cai; Xuding Zhu (J. Graph Theory, 2001)

Preface. - Frank K. Hwang; Xuding Zhu (Discret. Math., 2002)

Tight relation between the circular chromatic number and the girth of series-parallel graphs. - Zhishi Pan; Xuding Zhu (Discret. Math., 2002)

The circular chromatic number of series-parallel graphs of large odd girth. - Zhishi Pan; Xuding Zhu (Discret. Math., 2002)

On Hedetniemi's conjecture and the colour template scheme. - Claude Tardif; Xuding Zhu (Discret. Math., 2002)

The level of nonmultiplicativity of graphs. - Claude Tardif; Xuding Zhu (Discret. Math., 2002)

Asymptotic Clique Covering Ratios of Distance Graphs. - Daphne Der-Fen Liu; Xuding Zhu (Eur. J. Comb., 2002)

Circular Colouring and Orientation of Graphs. - Xuding Zhu (J. Comb. Theory B, 2002)

Edge-partitions of planar graphs and their game coloring numbers. - Wenjie He; Xiaoling Hou; Ko-Wei Lih; Jiating Shao; Weifan Wang 001; Xuding Zhu (J. Graph Theory, 2002)

Circular chromatic number of distance graphs with distance sets of cardinality 3. - Xuding Zhu (J. Graph Theory, 2002)

Circulant Distant Two Labeling and Circular Chromatic Number. - Daphne Der-Fen Liu; Xuding Zhu (Ars Comb., 2003)

Relaxed game chromatic number of graphs. - Chun-Yen Chou; Wei-Fan Wang 001; Xuding Zhu (Discret. Math., 2003)

Construction of Kn-minor free graphs with given circular chromatic number. - Sheng-Chyang Liaw; Zhishi Pan; Xuding Zhu (Discret. Math., 2003)

Coloring the square of a K4-minor free graph. - Ko-Wei Lih; Wei-Fan Wang 001; Xuding Zhu (Discret. Math., 2003)

4-Colorable 6-regular toroidal graphs. - Hong-Gwa Yeh; Xuding Zhu (Discret. Math., 2003)

Circular chromatic numbers of a class of distance graphs. - Xuding Zhu (Discret. Math., 2003)

An Analogue of Hajós' Theorem for the Circular Chromatic Number (II). - Xuding Zhu (Graphs Comb., 2003)

Circular chromatic number of Kneser graphs. - Hossein Hajiabolhassan; Xuding Zhu (J. Comb. Theory B, 2003)

Circular chromatic number of subgraphs. - Hossein Hajiabolhassan; Xuding Zhu (J. Graph Theory, 2003)

Circular chromatic number and Mycielski construction. - Hossein Hajiabolhassan; Xuding Zhu (J. Graph Theory, 2003)

Construction of graphs with given circular flow numbers. - Zhishi Pan; Xuding Zhu (J. Graph Theory, 2003)

Incidence coloring of k-degenerated graphs. - Mohammad Hosseini Dolama; Éric Sopena; Xuding Zhu (Discret. Math., 2004)

Relaxed game chromatic number of trees and outerplanar graphs. - Wenjie He; Jiaojiao Wu; Xuding Zhu (Discret. Math., 2004)

Sparse H-Colourable Graphs of Bounded Maximum Degree. - Hossein Hajiabolhassan; Xuding Zhu (Graphs Comb., 2004)

On sparse graphs with given colorings and homomorphisms. - Jaroslav Nesetril; Xuding Zhu (J. Comb. Theory B, 2004)

Fractional chromatic number and circular chromatic number for distance graphs with large clique size. - Daphne Der-Fen Liu; Xuding Zhu (J. Graph Theory, 2004)

Density of the circular chromatic numbers of series-parallel graphs. - Zhishi Pan; Xuding Zhu (J. Graph Theory, 2004)

Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks. - W. R. Chen; Frank K. Hwang; Xuding Zhu (SIAM J. Discret. Math., 2004)

Coloring the Cartesian Sum of Graphs. - Daphne Der-Fen Liu; Xuding Zhu (Electron. Notes Discret. Math., 2005)

Three classes of minimal circular-imperfect graphs. - Arnaud Pêcher; Annegret Wagler; Xuding Zhu (Electron. Notes Discret. Math., 2005)

Graphs of Large Girth with Prescribed Partial Circular Colourings. - Zhishi Pan; Xuding Zhu (Graphs Comb., 2005)

Circular chromatic index of graphs of maximum degree 3. - Peyman Afshani; Mahsa Ghandehari; Mahya Ghandehari; Hamed Hatami; Ruzbeh Tusserkani; Xuding Zhu (J. Graph Theory, 2005)

Erratum to: "Fractional chromatic number and circular chromatic number for distance graphs with large clique size" Journal of Graph Theory 47(2) 2004, 129-146. - Daphne Der-Fen Liu; Xuding Zhu (J. Graph Theory, 2005)

Circular perfect graphs. - Xuding Zhu (J. Graph Theory, 2005)

Circular choosability of graphs. - Xuding Zhu (J. Graph Theory, 2005)

Circular Distance Two Labeling and the lambda-Number for Outerplanar Graphs. - Daphne Der-Fen Liu; Xuding Zhu (SIAM J. Discret. Math., 2005)

Multilevel Distance Labelings for Paths and Cycles. - Daphne Der-Fen Liu; Xuding Zhu (SIAM J. Discret. Math., 2005)

Resource-sharing system scheduling and circular chromatic number. - Hong-Gwa Yeh; Xuding Zhu (Theor. Comput. Sci., 2005)

The d-relaxed game chromatic index of k-degenerated graphs. - Hungyung Chang; Xuding Zhu (Australas. J Comb., 2006)

Upper hamiltonian numbers and hamiltonian spectra of graphs. - Daniel Král'; Li-Da Tong; Xuding Zhu (Australas. J Comb., 2006)

Relaxed game chromatic number of outer planar graphs. - Jiaojiao Wu; Xuding Zhu (Ars Comb., 2006)

Uniquely circular colourable and uniquely fractional colourable graphs of large girth. - Xuding Zhu; Shuyuan Lin (Contributions Discret. Math., 2006)

On the circular chromatic number of circular partitionable graphs. - Arnaud Pêcher; Xuding Zhu (J. Graph Theory, 2006)

Cartesian powers of graphs can be distinguished by two labels. - Sandi Klavzar; Xuding Zhu (Eur. J. Comb., 2007)

Editorial note. - Gerard J. Chang; Hung-Lin Fu; Xuding Zhu (J. Comb. Optim., 2007)

The circular chromatic index of graphs of high girth. - Tomás Kaiser; Daniel Král; Riste Skrekovski; Xuding Zhu (J. Comb. Theory B, 2007)

List circular coloring of trees and cycles. - André Raspaud; Xuding Zhu (J. Graph Theory, 2007)

The Map-Coloring Game. - Tomasz Bartnicki; Jaroslaw Grytczuk; Hal A. Kierstead; Xuding Zhu (Am. Math. Mon., 2007)

Circular Degree Choosability. - Serguei Norine; Xuding Zhu (Electron. J. Comb., 2008)

Lower bounds for the game colouring number of partial k-trees and planar graphs. - Jiaojiao Wu; Xuding Zhu (Discret. Math., 2008)

The 6-relaxed game chromatic number of outerplanar graphs. - Jiaojiao Wu; Xuding Zhu (Discret. Math., 2008)

On the adaptable chromatic number of graphs. - Pavol Hell; Xuding Zhu (Eur. J. Comb., 2008)

Fractional chromatic number of distance graphs generated by two-interval sets. - Daphne Der-Fen Liu; Xuding Zhu (Eur. J. Comb., 2008)

Minimal circular-imperfect graphs of large clique number and large independence number. - Zhishi Pan; Xuding Zhu (Eur. J. Comb., 2008)

Activation strategy for asymmetric marking games. - Daqing Yang; Xuding Zhu (Eur. J. Comb., 2008)

Refined activation strategy for the marking game. - Xuding Zhu (J. Comb. Theory B, 2008)

Circular choosability via combinatorial Nullstellensatz. - Serguei Norine; Tsai-Lien Wong; Xuding Zhu (J. Graph Theory, 2008)

Circular chromatic index of Cartesian products of graphs. - Douglas B. West; Xuding Zhu (J. Graph Theory, 2008)

Game coloring the Cartesian product of graphs. - Xuding Zhu (J. Graph Theory, 2008)

Adapted List Coloring of Graphs and Hypergraphs. - Alexandr V. Kostochka; Xuding Zhu (SIAM J. Discret. Math., 2008)

On-Line List Colouring of Graphs. - Xuding Zhu (Electron. J. Comb., 2009)

Bipartite density of triangle-free subcubic graphs. - Xuding Zhu (Discret. Appl. Math., 2009)

Colouring games on outerplanar graphs and trees. - Hungyung Chang; Xuding Zhu (Discret. Math., 2009)

Game colouring of the square of graphs. - Louis Esperet; Xuding Zhu (Discret. Math., 2009)

Adaptable choosability of planar graphs with sparse short cycles. - Albert Guan; Xuding Zhu (Discret. Math., 2009)

Adaptable chromatic number of graph products. - Pavol Hell; Zhishi Pan; Tsai-Lien Wong; Xuding Zhu (Discret. Math., 2009)

Circular game chromatic number of graphs. - Wensong Lin; Xuding Zhu (Discret. Math., 2009)

Distinguishing labeling of group actions. - Tsai-Lien Wong; Xuding Zhu (Discret. Math., 2009)

Colouring graphs with bounded generalized colouring number. - Xuding Zhu (Discret. Math., 2009)

An upper bound on adaptable choosability of graphs. - Mickaël Montassier; André Raspaud; Xuding Zhu (Eur. J. Comb., 2009)

Bipartite subgraphs of triangle-free subcubic graphs. - Xuding Zhu (J. Comb. Theory B, 2009)

Adapted list coloring of planar graphs. - Louis Esperet; Mickaël Montassier; Xuding Zhu (J. Graph Theory, 2009)

The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three. - Hamed Hatami; Xuding Zhu (SIAM J. Discret. Math., 2009)

The Two-Coloring Number and Degenerate Colorings of Planar Graphs. - Hal A. Kierstead; Bojan Mohar; Simon Spacapan; Daqing Yang; Xuding Zhu (SIAM J. Discret. Math., 2009)

Game Colouring Directed Graphs. - Daqing Yang; Xuding Zhu (Electron. J. Comb., 2010)

Rainbow domination on trees. - Gerard J. Chang; Jiaojiao Wu; Xuding Zhu (Discret. Appl. Math., 2010)

Decomposition of sparse graphs, with application to game coloring number. - Mickaël Montassier; Arnaud Pêcher; André Raspaud; Douglas B. West; Xuding Zhu (Discret. Math., 2010)

Decomposition of sparse graphs into two forests, one having bounded maximum degree. - Mickaël Montassier; André Raspaud; Xuding Zhu (Inf. Process. Lett., 2010)

Total coloring of planar graphs of maximum degree eight. - Nicolas Roussel; Xuding Zhu (Inf. Process. Lett., 2010)

Choosability of toroidal graphs without short cycles. - Leizhen Cai; Weifan Wang 001; Xuding Zhu (J. Graph Theory, 2010)

Multi-coloring the Mycielskian of graphs. - Wensong Lin; Daphne Der-Fen Liu; Xuding Zhu (J. Graph Theory, 2010)

Claw-free circular-perfect graphs. - Arnaud Pêcher; Xuding Zhu (J. Graph Theory, 2010)

Multiple Coloring of Cone Graphs. - Zhishi Pan; Xuding Zhu (SIAM J. Discret. Math., 2010)

Complexity of Cycle Transverse Matching Problems. - Ross Churchley; Jing Huang 007; Xuding Zhu (IWOCA, 2011)

Graphs with chromatic numbers strictly less than their colouring numbers. - Xuding Zhu (Ars Math. Contemp., 2011)

Distinguishing labeling of the actions of almost simple groups. - Ákos Seress; Tsai-Lien Wong; Xuding Zhu (Comb., 2011)

Towards on-line Ohba's conjecture - Jakub Kozik; Piotr Micek; Xuding Zhu (CoRR, 2011)

Thue choosability of trees. - Francesca Fiorenzi; Pascal Ochem; Patrice Ossona de Mendez; Xuding Zhu (Discret. Appl. Math., 2011)

Acyclic 4-choosability of planar graphs. - Min Chen 012; André Raspaud; Nicolas Roussel; Xuding Zhu (Discret. Math., 2011)

The fractional version of Hedetniemi's conjecture is true. - Xuding Zhu (Eur. J. Comb., 2011)

Circular flow on signed graphs. - André Raspaud; Xuding Zhu (J. Comb. Theory B, 2011)

Entire colouring of plane graphs. - Weifan Wang 001; Xuding Zhu (J. Comb. Theory B, 2011)

Circular consecutive choosability of k-choosable graphs. - Daphne Der-Fen Liu; Serguei Norine; Zhishi Pan; Xuding Zhu (J. Graph Theory, 2011)

Short cycle covers of graphs and nowhere-zero flows. - Edita Mácajová; André Raspaud; Michael Tarsi; Xuding Zhu (J. Graph Theory, 2011)

Total weight choosability of graphs. - Tsai-Lien Wong; Xuding Zhu (J. Graph Theory, 2011)

Nonrepetitive list colourings of paths. - Jaroslaw Grytczuk; Jakub Przybylo; Xuding Zhu (Random Struct. Algorithms, 2011)

The surviving rate of an outerplanar graph for the firefighter problem. - Weifan Wang 001; Xubin Yue; Xuding Zhu (Theor. Comput. Sci., 2011)

On-Line List Colouring of Complete Multipartite Graphs. - Seog-Jin Kim; Young Soo Kwon; Daphne Der-Fen Liu; Xuding Zhu (Electron. J. Comb., 2012)

Preface. - R. Balakrishnan; R. B. Bapat 001; Sandi Klavzar; Ambat Vijayakumar; Thomas Zaslavsky; Xuding Zhu (Discret. Math., 2012)

Weighted-1-antimagic graphs of prime power order. - Po-Yi Huang; Tsai-Lien Wong; Xuding Zhu (Discret. Math., 2012)

Application of polynomial method to on-line list colouring of graphs. - Po-Yi Huang; Tsai-Lien Wong; Xuding Zhu (Eur. J. Comb., 2012)

Adapted game colouring of graphs. - Hal A. Kierstead; Chung-Ying Yang; Daqing Yang; Xuding Zhu (Eur. J. Comb., 2012)

Total weight choosability of Cartesian product of graphs. - Tsai-Lien Wong; Jiaojiao Wu; Xuding Zhu (Eur. J. Comb., 2012)

Decomposing a graph into forests. - Mickaël Montassier; Patrice Ossona de Mendez; André Raspaud; Xuding Zhu (J. Comb. Theory B, 2012)

Antimagic labelling of vertex weighted graphs. - Tsai-Lien Wong; Xuding Zhu (J. Graph Theory, 2012)

The surviving rate of planar graphs. - Jiangxu Kong; Weifan Wang 001; Xuding Zhu (Theor. Comput. Sci., 2012)

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. - Jonathan A. Noel; Douglas B. West; Hehui Wu; Xuding Zhu (CoRR, 2013)

Backbone coloring for graphs with large girths. - Yuehua Bu; Daphne Der-Fen Liu; Xuding Zhu (Discret. Math., 2013)

The strong game colouring number of directed graphs. - Wai Hong Chan; Wai Chee Shiu; Pak Kiu Sun; Xuding Zhu (Discret. Math., 2013)

Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond. - Jonathan A. Noel; Bruce A. Reed; Douglas B. West; Hehui Wu; Xuding Zhu (Electron. Notes Discret. Math., 2013)

Preface: optimization in graphs. - D. J. Guan; Ko-Wei Lih; Xuding Zhu (J. Comb. Optim., 2013)

The game Grundy number of graphs. - Frédéric Havet; Xuding Zhu (J. Comb. Optim., 2013)

A short proof for Chen's Alternative Kneser Coloring Lemma. - Gerard Jennhwa Chang; Daphne Der-Fen Liu; Xuding Zhu (J. Comb. Theory A, 2013)

Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree. - Seog-Jin Kim; Alexandr V. Kostochka; Douglas B. West; Hehui Wu; Xuding Zhu (J. Graph Theory, 2013)

Partial Online List Coloring of Graphs. - Tsai-Lien Wong; Xuding Zhu (J. Graph Theory, 2013)

Anti-magic labelling of Cartesian product of graphs. - Yu-Chang Liang; Xuding Zhu (Theor. Comput. Sci., 2013)

Lower Bounds for On-line Graph Colorings. - Grzegorz Gutowski; Jakub Kozik; Piotr Micek; Xuding Zhu (ISAAC, 2014)

List backbone colouring of graphs. - Yuehua Bu; Stephen Finbow; Daphne Der-Fen Liu; Xuding Zhu (Discret. Appl. Math., 2014)

Anti-magic labeling of trees. - Yu-Chang Liang; Tsai-Lien Wong; Xuding Zhu (Discret. Math., 2014)

Nonrepetitive colorings of lexicographic product of graphs. - Balázs Keszegh; Balázs Patkós; Xuding Zhu (Discret. Math. Theor. Comput. Sci., 2014)

Erratum to "Application of polynomial method to on-line list colouring of graphs" [European J. Combin. 33(2012) 872-883]. - Po-Yi Huang; Tsai-Lien Wong; Xuding Zhu (Eur. J. Comb., 2014)

Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs. - Jaehoon Kim; Alexandr V. Kostochka; Xuding Zhu (Eur. J. Comb., 2014)

Towards an on-line version of Ohba's conjecture. - Jakub Kozik; Piotr Micek; Xuding Zhu (Eur. J. Comb., 2014)

Colouring edges with many colours in cycles. - Jaroslav Nesetril; Patrice Ossona de Mendez; Xuding Zhu (J. Comb. Theory B, 2014)

Antimagic Labeling of Cubic Graphs. - Yu-Chang Liang; Xuding Zhu (J. Graph Theory, 2014)

Circular Chromatic Indices of Regular Graphs. - Cheyu Lin; Tsai-Lien Wong; Xuding Zhu (J. Graph Theory, 2014)

Maximum 4-Degenerate Subgraph of a Planar Graph. - Robert Lukot'ka; Ján Mazák; Xuding Zhu (Electron. J. Comb., 2015)

Characterization of $(2m, m)$-Paintable Graphs. - Thomas Mahoney; Jixian Meng; Xuding Zhu (Electron. J. Comb., 2015)

Locally planar graphs are 5-paintable. - Ming Han; Xuding Zhu (Discret. Math., 2015)

Circular chromatic indices of even degree regular graphs. - Cheyu Lin; Tsai-Lien Wong; Xuding Zhu (Discret. Math., 2015)

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. - Jonathan A. Noel; Douglas B. West; Hehui Wu; Xuding Zhu (Eur. J. Comb., 2015)

The game Grundy indices of graphs. - Wenchao Zhang; Xuding Zhu (J. Comb. Optim., 2015)

Circular flow number of highly edge connected signed graphs. - Xuding Zhu (J. Comb. Theory B, 2015)

Regular Graphs of Odd Degree Are Antimagic. - Daniel W. Cranston; Yu-Chang Liang; Xuding Zhu (J. Graph Theory, 2015)

Every graph is (2, 3)-choosable. - Tsai-Lien Wong; Xuding Zhu (Comb., 2016)

Fractional Thue chromatic number of graphs. - Yaling Zhong; Xuding Zhu (Discret. Appl. Math., 2016)

Circular total chromatic numbers of graphs. - Cheyu Lin; Xuding Zhu (Discret. Math., 2016)

Locally planar graphs are 2-defective 4-paintable. - Ming Han; Xuding Zhu (Eur. J. Comb., 2016)

Preface. - Andreas M. Hinz; S. Arumugam 001; Rangaswami Balakrishnan; S. Francis Raj; T. Karthick; K. Somasundaram; Xuding Zhu (Electron. Notes Discret. Math., 2016)

Total Weight Choosability of Cone Graphs. - Yunfang Tang; Tsai-Lien Wong; Xuding Zhu (Graphs Comb., 2016)

(2+ϵ)-Nonrepetitive List Colouring of Paths. - Huanhua Zhao; Xuding Zhu (Graphs Comb., 2016)

A combinatorial proof for the circular chromatic number of Kneser graphs. - Daphne Der-Fen Liu; Xuding Zhu (J. Comb. Optim., 2016)

Antimagic Labeling of Regular Graphs. - Fei-Huang Chang; Yu-Chang Liang; Zhishi Pan; Xuding Zhu (J. Graph Theory, 2016)

Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions. - Jaehoon Kim; Alexandr V. Kostochka; Xuding Zhu (J. Graph Theory, 2016)

Strong Chromatic Index of Sparse Graphs. - Daqing Yang; Xuding Zhu (J. Graph Theory, 2016)

Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks. - Zhao Zhang 002; James Willson; Zaixin Lu; Weili Wu 001; Xuding Zhu; Ding-Zhu Du (IEEE/ACM Trans. Netw., 2016)

Permanent Index of Matrices Associated with Graphs. - Tsai-Lien Wong; Xuding Zhu (Electron. J. Comb., 2017)

Choosability and paintability of the lexicographic product of graphs. - Balázs Keszegh; Xuding Zhu (Discret. Appl. Math., 2017)

The wide-diameter of Zn, k. - Hao Qi 001; Xuding Zhu (Discret. Appl. Math., 2017)

Total weight choosability of graphs with bounded maximum average degree. - Yunfang Tang; Xuding Zhu (Discret. Math., 2017)

DP-colorings of graphs with high chromatic number. - Anton Bernshteyn; Alexandr V. Kostochka; Xuding Zhu (Eur. J. Comb., 2017)

Total weight choosability of Mycielski graphs. - Yunfang Tang; Xuding Zhu (J. Comb. Optim., 2017)

Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. - Min Chen 012; Seog-Jin Kim; Alexandr V. Kostochka; Douglas B. West; Xuding Zhu (J. Comb. Theory B, 2017)

Multiple list colouring of planar graphs. - Xuding Zhu (J. Comb. Theory B, 2017)

On (4, 2)-Choosable Graphs. - Jixian Meng; Gregory J. Puleo; Xuding Zhu (J. Graph Theory, 2017)

A Hypercube Variant with Small Diameter. - Xuding Zhu (J. Graph Theory, 2017)

Total Weight Choosability of Trees. - Gerard Jennhwa Chang; Guan-Huei Duh; Tsai-Lien Wong; Xuding Zhu (SIAM J. Discret. Math., 2017)

Defective 3-Paintability of Planar Graphs. - Grzegorz Gutowski; Ming Han; Tomasz Krawczyk; Xuding Zhu (Electron. J. Comb., 2018)

The fault-diameter and wide-diameter of twisted hypercubes. - Hao Qi 001; Xuding Zhu (Discret. Appl. Math., 2018)

Total list weighting of graphs with bounded maximum average degree. - Yu-Chang Liang; Yunfang Tang; Tsai-Lien Wong; Xuding Zhu (Discret. Math., 2018)

Graphs with maximum average degree less than 114 are (1, 3)-choosable. - Yu-Chang Liang; Tsai-Lien Wong; Xuding Zhu (Discret. Math., 2018)

List colouring of graphs and generalized Dyck paths. - Rongxing Xu; Yeong-Nan Yeh; Xuding Zhu (Discret. Math., 2018)

Randomly twisted hypercubes. - Andrzej Dudek; Xavier Pérez-Giménez; Pawel Pralat; Hao Qi 001; Douglas B. West; Xuding Zhu (Eur. J. Comb., 2018)

Greedy Nimk Game. - Xinzhong Lv; Rongxing Xu; Xuding Zhu (J. Comb. Optim., 2018)

Completing orientations of partially oriented graphs. - Jørgen Bang-Jensen; Jing Huang 007; Xuding Zhu (J. Graph Theory, 2018)

Bounded Greedy Nim. - Rongxing Xu; Xuding Zhu (Theor. Comput. Sci., 2018)

A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function. - Claude Tardif; Xuding Zhu (Electron. J. Comb., 2019)

Extremal problems on saturation for the family of k-edge-connected graphs. - Hui Lei 002; Suil O; Yongtang Shi; Douglas B. West; Xuding Zhu (Discret. Appl. Math., 2019)

Graphs are (1, Δ+1)-choosable. - Laihao Ding; Guan-Huei Duh; Guanghui Wang 002; Tsai-Lien Wong; Jianliang Wu 001; Xiaowei Yu; Xuding Zhu (Discret. Math., 2019)

Colouring of generalized signed triangle-free planar graphs. - Yiting Jiang; Daphne Der-Fen Liu; Yeong-Nan Yeh; Xuding Zhu (Discret. Math., 2019)

Extensions of matroid covering and packing. - Genghua Fan; Hongbi Jiang; Ping Li 025; Douglas B. West; Daqing Yang; Xuding Zhu (Eur. J. Comb., 2019)

Hamiltonian Spectra of Graphs. - Li-Da Tong; Hao-Yu Yang; Xuding Zhu (Graphs Comb., 2019)

Multiple list colouring triangle free planar graphs. - Yiting Jiang; Xuding Zhu (J. Comb. Theory B, 2019)

The Alon-Tarsi number of planar graphs. - Xuding Zhu (J. Comb. Theory B, 2019)

$4$-Colouring of Generalized Signed Planar Graphs. - Yiting Jiang; Xuding Zhu (Electron. J. Comb., 2020)

Clustering Powers of Sparse Graphs. - Jaroslav Nesetril; Patrice Ossona de Mendez; Michal Pilipczuk; Xuding Zhu (Electron. J. Comb., 2020)

A Note on the Poljak-Rödl Function. - Xuding Zhu (Electron. J. Comb., 2020)

A connected version of the graph coloring game. - Clément Charpentier; Hervé Hocquard; Éric Sopena; Xuding Zhu (Discret. Appl. Math., 2020)

A note about online nonrepetitive coloring k-trees. - Balázs Keszegh; Xuding Zhu (Discret. Appl. Math., 2020)

On-line DP-coloring of graphs. - Seog-Jin Kim; Alexandr V. Kostochka; Xuer Li; Xuding Zhu (Discret. Appl. Math., 2020)

The strong fractional choice number of series-parallel graphs. - Xuer Li; Xuding Zhu (Discret. Math., 2020)

The Alon-Tarsi number of planar graphs without cycles of lengths 4 and l. - Huajing Lu; Xuding Zhu (Discret. Math., 2020)

A refinement of choosability of graphs. - Xuding Zhu (J. Comb. Theory B, 2020)

The Alon-Tarsi number of a planar graph minus a matching. - Jaroslaw Grytczuk; Xuding Zhu (J. Comb. Theory B, 2020)

Fractional DP-colorings of sparse graphs. - Anton Bernshteyn; Alexandr V. Kostochka; Xuding Zhu (J. Graph Theory, 2020)

List coloring triangle-free planar graphs. - Jianzhang Hu; Xuding Zhu (J. Graph Theory, 2020)

Multiple list coloring of 3-choice critical graphs. - Rongxing Xu; Xuding Zhu (J. Graph Theory, 2020)

Circular Chromatic Number of Signed Graphs. - Reza Naserasr; Zhouningxin Wang; Xuding Zhu (Electron. J. Comb., 2021)

Every planar graph is 1-defective (9, 2)-paintable. - Ming Han; Hal A. Kierstead; Xuding Zhu (Discret. Appl. Math., 2021)

Colouring of S-labelled planar graphs. - Ligang Jin; Tsai-Lien Wong; Xuding Zhu (Eur. J. Comb., 2021)

Total weight choosability for Halin graphs. - Yu-Chang Liang; Tsai-Lien Wong; Xuding Zhu (Electron. J. Graph Theory Appl., 2021)

Generalized List Colouring of Graphs. - Eun-Kyung Cho; Ilkyoo Choi; Yiting Jiang; Ringi Kim; Boram Park; Jiayan Yan; Xuding Zhu (Graphs Comb., 2021)

Relatively small counterexamples to Hedetniemi's conjecture. - Xuding Zhu (J. Comb. Theory B, 2021)

Chromatic λ-choosable and λ-paintable graphs. - Jialu Zhu; Xuding Zhu (J. Graph Theory, 2021)

Dense Eulerian Graphs are $(1, 3)$-Choosable. - Huajing Lu; Xuding Zhu (Electron. J. Comb., 2022)

The Fractional Chromatic Number of Generalized Cones over Graphs. - Jialu Zhu; Xuding Zhu (Electron. J. Comb., 2022)

Generalized signed graphs of large girth and large chromatic number. - Yangyan Gu; Hao Qi 001; Yeong-Nan Yeh; Xuding Zhu (Discret. Math., 2022)

Signed planar graphs with given circular chromatic numbers. - Yangyan Gu; Xuding Zhu (Discret. Math., 2022)

The circular chromatic numbers of signed series-parallel graphs. - Zhishi Pan; Xuding Zhu (Discret. Math., 2022)

Multiple DP-Coloring of Planar Graphs Without 3-Cycles and Normally Adjacent 4-Cycles. - Huan Zhou; Xuding Zhu (Graphs Comb., 2022)

Every nice graph is (1, 5)-choosable. - Xuding Zhu (J. Comb. Theory B, 2022)

Decomposing planar graphs into graphs with degree restrictions. - Eun-Kyung Cho; Ilkyoo Choi; Ringi Kim; Boram Park; Tingting Shan; Xuding Zhu (J. Graph Theory, 2022)

3-Degenerate induced subgraph of a planar graph. - Yangyan Gu; Hal A. Kierstead; Sang-il Oum; Hao Qi 001; Xuding Zhu (J. Graph Theory, 2022)

Signed colouring and list colouring of k-chromatic graphs. - Ringi Kim; Seog-Jin Kim; Xuding Zhu (J. Graph Theory, 2022)

The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs. - Rongxing Xu; Xuding Zhu (SIAM J. Discret. Math., 2022)

Weak Degeneracy of Planar Graphs and Locally Planar Graphs. - Ming Han; Tao Wang 005; Jianglin Wu; Huan Zhou; Xuding Zhu (Electron. J. Comb., 2023)

Weak (2,3)-Decomposition of Planar Graphs. - Ming Han; Xuding Zhu (Electron. J. Comb., 2023)

List 4-colouring of planar graphs. - Xuding Zhu (J. Comb. Theory B, 2023)

The strong fractional choice number of 3-choice-critical graphs. - Rongxing Xu; Xuding Zhu (J. Graph Theory, 2023)

Decomposition of planar graphs with forbidden configurations. - Lingxi Li; Huajing Lu; Tao Wang 005; Xuding Zhu (Discret. Appl. Math., 2023)

Girth and λ $ lambda $-choosability of graphs. - Yangyan Gu; Xuding Zhu (J. Graph Theory, 2023)

Refined List Version of Hadwiger's Conjecture. - Yangyan Gu; Yiting Jiang; David R. Wood; Xuding Zhu (SIAM J. Discret. Math., 2023)

2-Reconstructibility of Strongly Regular Graphs and 2-Partially Distance-Regular Graphs. - Douglas B. West; Xuding Zhu (Graphs Comb., 2023)

The circular chromatic number of signed series-parallel graphs of given girth. - Jialu Zhu; Xuding Zhu (Discret. Appl. Math., 2023)

Bad list assignments for non-k $k$-choosable k $k$-chromatic graphs with 2k+2 $2k+2$-vertices. - Jialu Zhu; Xuding Zhu (J. Graph Theory, 2023)

Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable. - Yingli Kang; Ligang Jin; Xuding Zhu (J. Graph Theory, 2024)

Circular flows in mono-directed signed graphs. - Jiaao Li; Reza Naserasr; Zhouningxin Wang; Xuding Zhu (J. Graph Theory, 2024)

Defective acyclic colorings of planar graphs. - On-Hei Solomon Lo; Ben Seamone; Xuding Zhu (J. Graph Theory, 2024)

The Alon-Tarsi number of planar graphs revisited. - Yangyan Gu; Xuding Zhu (J. Graph Theory, 2024)

Odd 4-Coloring of Outerplanar Graphs. - Masaki Kashima; Xuding Zhu (Graphs Comb., 2024)

A survey on Hedetniemi's conjecture. - Xuding Zhu (Comput. Sci. Rev., 2025)

Decomposition of triangle-free planar graphs. - Rongxing Xu; Xuding Zhu (Eur. J. Comb., 2025)

Degree-truncated choosability of graphs. - Huan Zhou; Jialu Zhu; Xuding Zhu (J. Comb. Theory B, 2025)

List Dynamic 4-Coloring of Planar Graphs. - Seog-Jin Kim; Sang June Lee; Xiaopan Lian; Xuding Zhu (Graphs Comb., 2025)

On two problems of defective choosability of graphs. - Jie Ma 002; Rongxing Xu; Xuding Zhu (J. Graph Theory, 2025)