Xuding Zhu | Academic Influence

Q: What Schools Are Affiliated With Xuding Zhu

Xuding Zhu is affiliated with the following schools: Zhejiang Normal University, University of Calgary, National Sun Yat-sen University

Why Is Xuding Zhu Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Xuding Zhu's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Circular chromatic number: a survey (2001) (352)
Multilevel Distance Labelings for Paths and Cycles (2005) (132)
Acyclic and oriented chromatic numbers of graphs (1997) (124)
Duality and Polynomial Testing of Tree Homomorphisms (1996) (115)
Colouring graphs with bounded generalized colouring number (2009) (108)
Game chromatic number of outerplanar graphs (1999) (106)
The Game Coloring Number of Planar Graphs (1999) (101)
Star chromatic numbers and products of graphs (1992) (101)
Refined activation strategy for the marking game (2008) (97)
A bound for the game chromatic number of graphs (1999) (95)
Recent Developments in Circular Colouring of Graphs (2006) (87)
Rainbow domination on trees (2010) (83)
The Map-Coloring Game (2007) (81)
On-Line List Colouring of Graphs (2009) (80)
A SURVEY ON HEDETNIEMI'S CONJECTURE (1998) (79)
The game coloring number of pseudo partial k-trees (2000) (79)
Coloring the square of a K4-minor free graph (2003) (76)
Game chromatic index of k-degenerate graphs (2001) (74)
Distinguishing labellings of group action on vector spaces and graphs (2006) (66)
Circular chromatic numbers of Mycielski's graphs (1999) (65)
Antimagic Labeling of Regular Graphs (2015) (62)
Cartesian powers of graphs can be distinguished by two labels (2007) (60)
Edge‐partitions of planar graphs and their game coloring numbers (2002) (57)
Complexity of Tree Homomorphisms (1996) (54)
The fractional version of Hedetniemi's conjecture is true (2011) (53)
Distance Graphs and T-Coloring (1999) (51)
A Coloring Problem for Weighted Graphs (1997) (50)
Regular Graphs of Odd Degree Are Antimagic (2013) (50)
On sparse graphs with given colorings and homomorphisms (2004) (46)
Antimagic labelling of vertex weighted graphs (2012) (46)
Anti-magic labeling of trees (2014) (46)
Circular flow on signed graphs (2011) (45)
Star-extremal graphs and the lexicographic product (1996) (45)
Incidence coloring of k-degenerated graphs (2004) (45)
Uniquely H -colorable graphs with large girth (1996) (44)
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs (1998) (43)
Decomposing a graph into forests (2012) (43)
The circular chromatic number of series-parallel graphs (2000) (43)
Homomorphisms to oriented paths (1994) (42)
The chromatic numbers of distance graphs (1997) (42)
Circular Chromatic Number of Planar Graphs of Large Odd Girth (2001) (42)
Game coloring the Cartesian product of graphs (2008) (40)
Every graph is (2,3)-choosable (2016) (40)
Circular chromatic number of distance graphs with distance sets of cardinality 3 (2002) (40)
Lower bounds for the game colouring number of partial k-trees and planar graphs (2008) (39)
Relaxed game chromatic number of graphs (2003) (39)
Circular perfect graphs (2005) (37)
The Existence of Homomorphisms to Oriented Cycles (1995) (36)
DP-colorings of graphs with high chromatic number (2017) (36)
Nonrepetitive list colourings of paths (2011) (36)
Thue choosability of trees (2011) (36)
Circular chromatic number and Mycielski construction (2003) (34)
Total weight choosability of graphs (2011) (33)
Edge-partitions of planar graphs and their game coloring numbers (2002) (32)
Star chromatic numbers of graphs (1996) (32)
Planar Graphs with Circular Chromatic Numbers between 3 and 4 (1999) (31)
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree (2013) (30)
Circular chromatic number of Kneser graphs (2003) (29)
Pattern Periodic Coloring of Distance Graphs (1998) (29)
Adapted List Coloring of Graphs and Hypergraphs (2008) (28)
Weighted-1-antimagic graphs of prime power order (2012) (27)
Fractional chromatic number and circular chromatic number for distance graphs with large clique size (2004) (27)
Approximating Maximum Lifetime $k$ -Coverage Through Minimizing Weighted $k$ -Cover in Homogeneous Wireless Sensor Networks (2016) (27)
On bounded treewidth duality of graphs (1996) (27)
Entire colouring of plane graphs (2011) (27)
On the adaptable chromatic number of graphs (2008) (26)
Acyclic 4-choosability of planar graphs (2011) (25)
Minimal Oriented Graphs of Diameter 2 (1998) (25)
Distance graphs with missing multiples in the distance sets (1999) (25)
Coloring-flow duality of embedded graphs (2004) (25)
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs (2014) (24)
Antimagic Labeling of Cubic Graphs (2014) (24)
Application of polynomial method to on-line list colouring of graphs (2012) (24)
Homomorphisms to oriented cycles (1993) (24)
The surviving rate of planar graphs (2012) (24)
Star Extremal Circulant Graphs (1999) (23)
Circular colorings of weighted graphs (1996) (23)
Relaxed game chromatic number of trees and outerplanar graphs (2004) (23)
Coloring, sparseness and girth (2014) (22)
Circular choosability of graphs (2005) (22)
The Alon-Tarsi number of a planar graph minus a matching (2018) (21)
Total coloring of planar graphs of maximum degree eight (2010) (21)
The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three (2009) (21)
The Alon-Tarsi number of planar graphs (2017) (21)
Circular chromatic index of graphs of maximum degree 3 (2005) (21)
Resource-sharing system scheduling and circular chromatic number (2005) (21)
Circular Distance Two Labeling and the lambda-Number for Outerplanar Graphs (2005) (21)
Adapted list coloring of planar graphs (2009) (20)
4-Colorable 6-regular toroidal graphs (2003) (20)
Circulant Distant Two Labeling and Circular Chromatic Number (2003) (20)
Construction of uniquely H-colorable graphs (1999) (19)
Path homomorphisms (1996) (19)
List Total Weighting of Graphs (2010) (19)
Towards an on-line version of Ohba's conjecture (2014) (19)
A refinement of choosability of graphs (2018) (18)
An analogue of Hajós’ Theorem for the circular chromatic number (2001) (18)
On-Line List Colouring of Complete Multipartite Graphs (2012) (18)
A simple proof of the multiplicativity of directed cycles of prime power length (1992) (17)
Construction of graphs with given circular flow numbers (2003) (17)
Total weight choosability of Cartesian product of graphs (2012) (17)
Fractional chromatic number of distance graphs generated by two-interval sets (2008) (17)
The fractional chromatic number of the direct product of graphs (2002) (17)
Circular colouring and graph homomorphism (1999) (16)
Graphs Whose Circular Chromatic Number Equals the Chromatic Number (1999) (16)
Bipartite density of triangle-free subcubic graphs (2009) (16)
Relaxed Coloring of a Graph (1998) (16)
The surviving rate of an outerplanar graph for the firefighter problem (2011) (16)
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions (2016) (15)
Chromatic Ramsey numbers (1998) (15)
On Hedetniemi's conjecture and the colour template scheme (2002) (15)
The game Grundy number of graphs (2013) (15)
On the bounds for the ultimate independence ratio of a graph (1996) (15)
Completing orientations of partially oriented graphs (2015) (15)
Activation strategy for asymmetric marking games (2008) (15)
The Two-Coloring Number and Degenerate Colorings of Planar Graphs (2009) (14)
Decomposition of sparse graphs, with application to game coloring number (2010) (14)
Relatively small counterexamples to Hedetniemi's conjecture (2020) (14)
A simple proof of Moser's theorem (1999) (14)
Circular flow number of highly edge connected signed graphs (2012) (13)
Game Colouring Directed Graphs (2010) (13)
A Polynomial Algorithm for Homomorphisms to Oriented Cycles (1995) (13)
Choosability of toroidal graphs without short cycles (2010) (13)
Distinguishing labeling of group actions (2009) (12)
Multiple list colouring of planar graphs (2016) (12)
The circular chromatic index of graphs of high girth (2007) (12)
Adaptable chromatic number of graph products (2009) (12)
A Hypercube Variant with Small Diameter (2017) (12)
A short proof for Chen's Alternative Kneser Coloring Lemma (2013) (12)
The Level of Nonmultiplicativity of Graphs (2001) (12)
Construction of Kn-minor free graphs with given circular chromatic number (2003) (12)
A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function (2019) (12)
Tight relation between the circular chromatic number and the girth of series-parallel graphs (2002) (12)
Permanent Index of Matrices Associated with Graphs (2015) (11)
Upper hamiltonian numbers and hamiltonian spectra of graphs (2006) (11)
Coloring the Cartesian Sum of Graphs (2005) (11)
Bipartite subgraphs of triangle-free subcubic graphs (2009) (11)
An Analogue of Hajós' Theorem for the Circular Chromatic Number (II) (2003) (11)
Perfect Graphs for Generalized Colouring-Circular Perfect Graphs (2001) (11)
Circular choosability via combinatorial Nullstellensatz (2008) (11)
CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS (2000) (10)
Short cycle covers of graphs and nowhere‐zero flows (2011) (10)
Circular Colouring and Orientation of Graphs (2002) (10)
Lower Bounds for On-line Graph Colorings (2014) (10)
List circular coloring of trees and cycles (2007) (10)
Three classes of minimal circular-imperfect graphs (2005) (10)
Adapted list colouring of planar graphs (2009) (10)
Construction of sparse graphs with prescribed circular colorings (2001) (10)
Circular Chromatic Number of Signed Graphs (2020) (10)
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices (2013) (10)
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond (2013) (10)
On homomorphisms to acyclic local tournaments (1995) (10)
Claw‐free circular‐perfect graphs (2007) (9)
Multiplicativity of Oriented Cycles (1994) (9)
Circular chromatic index of Cartesian products of graphs (2008) (9)
Circular chromatic number of subgraphs (2003) (9)
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2 (2015) (9)
Graphs are (1, Δ+1)-choosable (2019) (9)
Game colouring of the square of graphs (2009) (8)
Density of the circular chromatic numbers of series‐parallel graphs (2004) (8)
Construction of uniquelyH-colorable graphs (1999) (8)
An upper bound on adaptable choosability of graphs (2009) (8)
Adapted game colouring of graphs (2012) (8)
On the circular chromatic number of circular partitionable graphs (2006) (8)
Clustering powers of sparse graphs (2020) (8)
Fractional DP‐colorings of sparse graphs (2018) (8)
Multiple list colouring triangle free planar graphs (2018) (7)
Circular chromatic numbers of a class of distance graphs (2003) (7)
Towards on-line Ohba's conjecture (2011) (7)
Total weight choosability of d-degenerate graphs (2015) (7)
Multiple Capacity Vehicle Routing on Paths (1998) (7)
A Note on the Poljak-Rödl Function (2019) (7)
Nonrepetitive colorings of lexicographic product of graphs (2012) (7)
Maximum 4-Degenerate Subgraph of a Planar Graph (2013) (7)
Multiple Coloring of Cone Graphs (2010) (7)
The Alon-Tarsi number of subgraphs of a planar graph (2019) (6)
Minimal circular-imperfect graphs of large clique number and large independence number (2008) (6)
Oriented walk double covering and bidirectional double tracing (1998) (6)
Strong Chromatic Index of Sparse Graphs (2016) (6)
Locally planar graphs are 2-defective 4-paintable (2016) (6)
Multi‐coloring the Mycielskian of graphs (2010) (6)
Density of the circular chromatic numbers of series-parallel graphs (2004) (6)
A Connected Version of the Graph Coloring Game (2019) (5)
A combinatorial proof for the circular chromatic number of Kneser graphs (2016) (5)
On-line DP-coloring of graphs (2020) (5)
Decomposing planar graphs into graphs with degree restrictions (2020) (5)
Total weight choosability of Mycielski graphs (2017) (5)
Colouring of S-labelled planar graphs (2021) (5)
CIRCULAR CONSECUTIVE CHOOSABILITY OF GRAPHS (2008) (5)
The circular chromatic number of induced subgraphs (2004) (5)
Relaxed game chromatic number of outer planar graphs (2006) (5)
ON-LINE 3-CHOOSABLE PLANAR GRAPHS (2012) (5)
Multiplicativity of acyclic local tournaments (1997) (5)
Defective 3-Paintability of Planar Graphs (2017) (5)
The Alon-Tarsi number of planar graphs without cycles of lengths 4 and l (2019) (5)
Anti-magic labelling of Cartesian product of graphs (2013) (5)
Total Weight Choosability of Trees (2017) (4)
The Z-cubes: a hypercube variant with small diameter (2015) (4)
Graphs with maximum average degree less than 114 are (1, 3)-choosable (2018) (4)
$$(2+\epsilon )$$(2+ϵ)-Nonrepetitive List Colouring of Paths (2016) (4)
Locally planar graphs are 5-paintable (2015) (4)
The strong fractional choice number of series-parallel graphs (2019) (4)
Colouring edges with many colours in cycles (2011) (4)
Adaptable choosability of planar graphs with sparse short cycles (2009) (4)
The 6-relaxed game chromatic number of outerplanar graphs (2008) (4)
Colouring of generalized signed triangle-free planar graphs (2019) (4)
Multi-colouring the Mycielskian of Graphs Wensong Lin (4)
Every nice graph is (1, 5)-choosable (2021) (4)
Colouring of generalized signed planar graphs (2018) (4)
Characterization of $(2m, m)$-Paintable Graphs (2015) (4)
The strong game colouring number of directed graphs (2013) (4)
Multiplicative posets (1991) (3)
of Paths (2015) (3)
Multi-coloring the Mycielskian of graphs (2010) (3)
On (4, 2)‐Choosable Graphs (2014) (3)
The d-relaxed game chromatic index of k-degenerated graphs (2006) (3)
A note on graph reconstruction (1997) (3)
Graphs of Large Girth with Prescribed Partial Circular Colourings (2005) (3)
Circular Degree Choosability (2008) (3)
Colouring of S-labeled planar graphs (2019) (3)
Note on Hedetniemi’s Conjecture and the Poljak-Rödl Function (2019) (3)
Fractional Thue chromatic number of graphs (2016) (3)
Nonrepetitive colorings of lexicographic product of pathsand other graphs (2014) (3)
Complexity of Cycle Transverse Matching Problems (2011) (3)
Backbone coloring for graphs with large girths (2013) (3)
Total Weight Choosability of Cone Graphs (2016) (3)
The fault-diameter and wide-diameter of twisted hypercubes (2018) (3)
Partial Online List Coloring of Graphs (2013) (3)
Extremal problems on saturation for the family of k-edge-connected graphs (2017) (3)
Circular Chromatic Indices of Regular Graphs (2014) (3)
Extensions of matroid covering and packing (2019) (3)
Randomly twisted hypercubes (2018) (3)
Chromatic Number and Orientations of Graphs and Signed Graphs (2019) (3)
Sparse H-Colourable Graphs of Bounded Maximum Degree (2004) (3)
Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks (2004) (3)
Ramsey families which exclude a graph (1995) (3)
$4$-Colouring of Generalized Signed Planar Graphs (2020) (3)
Nonrepetitive colorings of blow-ups of graphs (2012) (3)
Chromatic λ ‐choosable and λ ‐paintable graphs (2021) (2)
Every 2-choosable graph is circular consecutive 2-choosable (2007) (2)
Decomposition of sparse graphs into two forests, one having bounded maximum degree (2010) (2)
List backbone colouring of graphs (2014) (2)
The circular chromatic numbers of signed series-parallel graphs (2022) (2)
Distinguishing labeling of the actions of almost simple groups (2011) (2)
Erratum to "Application of polynomial method to on-line list colouring of graphs" [European J. Combin. 33(2012) 872-883] (2014) (2)
The game Grundy indices of graphs (2015) (2)
The wide-diameter of Zn, k (2017) (2)
List colouring of graphs and generalized Dyck paths (2017) (2)
List coloring triangle‐free planar graphs (2019) (2)
Decomposition of planar graphs with forbidden configurations (2021) (2)
Minimum non-chromatic-choosable graphs with given chromatic number (2022) (2)
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (2021) (2)
Circular game chromatic number of graphs (2009) (2)
Total weight choosability of graphs with bounded maximum average degree (2017) (2)
Generalized List Colouring of Graphs (2020) (2)
Colouring games on outerplanar graphs and trees (2009) (2)
Bounded Greedy Nim (2018) (2)
Greedy Nim$$_\mathrm{{k}}$$k Game (2018) (1)
Circular chromatic indices of even degree regular graphs (2015) (1)
The Alon-Tarsi number of planar graphs -- a simple proof (2022) (1)
The strong fractional choice number of 3‐choice‐critical graphs (2020) (1)
Refined list version of Hadwiger's conjecture (2022) (1)
Uniquely circular colourable and uniquely fractional colourable graphs of large girth (2006) (1)
A note on two conjectures that strengthen the four colour theorem (2017) (1)
Pseudo-Hamiltonian-connected graphs (2000) (1)
A combinatorial proof for the circular chromatic number of Kneser graphs (2015) (1)
Edge-partitions of sparse graphs and their applications to game coloring (2009) (1)
Bounds on circular consecutive choosability (2008) (1)
Graphs with chromatic numbers strictly less than their colouring numbers (2010) (1)
List 4-colouring of planar graphs (2022) (1)
Multiple list coloring of 3‐choice critical graphs (2020) (1)
A note about online nonrepetitive coloring k-trees (2019) (1)
Journal of Combinatorial Optimization: Editorial note (2006) (1)
The slow-coloring game on sparse graphs: $k$-degenerate, planar, and outerplanar (2018) (1)
Every planar graph is 1-defective (9, 2)-paintable (2016) (1)
Bad list assignments for non-$k$-choosable $k$-chromatic graphs with $2k+2$-vertices (2022) (1)
Multiple colouring of cone graphs Zhishi Pan and (2007) (1)
Signed colouring and list colouring of k ‐chromatic graphs (2021) (1)
The game chromatic number of graphs (2006) (1)
How unique is Lovász's theta function? (2012) (0)
Martin Gardner in the Twenty-First Century: The Map-Coloring Game (2012) (0)
Circular consecutive choosability of k‐choosable graphs (2011) (0)
Chromatic $\lambda$-choosable and $\lambda$-paintable graphs (2019) (0)
ACYCLIC AND ORIENTEDCHROMATIC NUMBERSOF (1997) (0)
Total Weight Choosability of Cone Graphs (2015) (0)
Diophantine approximations and its applications to graph colouring problems (1998) (0)
of Cartesian Products of Graphs (2007) (0)
Hamiltonian Spectra of Graphs (2019) (0)
Preface: optimization in graphs (2013) (0)
Cycle Adjacency of Planar Graphs and 3-Colourability (2011) (0)
The fractional chromatic number of double cones over graphs (2021) (0)
Generalized signed graphs of large girth and large chromatic number (2022) (0)
Defective acyclic colorings of planar graphs (2023) (0)
Coloring , sparseness , and girth Noga Alon (2014) (0)
Hamiltonian Spectra of Graphs (2019) (0)
Uniquely H-colorable graphs with large girth (1996) (0)
Triangle-free subcubic graphs with small bipartite density (2008) (0)
Circular chromatic Ramsey number (2017) (0)
Graphs and Combinatorics Relaxed Coloring of a Graph (1998) (0)
The game Grundy number of graphs (2012) (0)
Total weight choosability of Mycielski graphs (2015) (0)
C O ] 1 5 O ct 2 02 0 Circular chromatic number of signed graphs (2020) (0)
C O ] 3 O ct 2 01 5 Permanent index of matrices associated with graphs (2018) (0)
D. Liu and X. Zhu, 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 (2005) (0)
Minimum non-chromatic-$\lambda$-choosable graphs (2022) (0)
Girth and λ $\lambda $‐choosability of graphs (2021) (0)
Paintability of the lexicographic product of graphs (2015) (0)
Alon–Tarsi Theorem and Its Applications (2021) (0)
D. Liu and X. Zhu, Erratum to: “Fractional chromatic number and circular chromatic number for distance graphs with large clique size”. Journal of Graph Theory47(2) 2004, 129–146 (2005) (0)
Preface (2002) (0)
Total weight choosability for Halin graphs (2017) (0)
Preface: optimization in graphs (2013) (0)
Choosability and paintability of the lexicographic product of graphs (2015) (0)
Backbone Coloring for Graphs with Large Girths Yuehua Bu (2013) (0)
Permanent and Vertex-edge Weighting (2021) (0)
Adapted list colouring of planar graphs Louis Esperet (2007) (0)
Some Definitions and Notations (2021) (0)
Every graph is (2,3)-choosable (2014) (0)
Fractional Chromatic Number of Distance Graphs and Density of Integral Sets with Missing Differences (0)
C O ] 2 8 O ct 2 01 9 Strong fractional choice number of series-parallel graphs (2019) (0)
Greedy Nimk Game (2018) (0)
Preface (2012) (0)
Combinatorial optimization and applications : 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011 : proceedings (2011) (0)
The Slow-coloring Game on Outerplanar, Planar, and $k$-degenerate Graphs (2018) (0)
Preface (2016) (0)
Multiple DP-Coloring of Planar Graphs Without 3-Cycles and Normally Adjacent 4-Cycles (2022) (0)
Choosability of Squares of K4-minor Free Graphs (2008) (0)
Dense Eulerian Graphs are $(1, 3)$-Choosable (2021) (0)
Signed planar graphs with given circular chromatic numbers (2022) (0)
Degenerated induced subgraphs of planar graphs (2013) (0)
The Fractional Chromatic Number of Generalized Cones over Graphs (2022) (0)
Adaptable Colouring of Graph Products Pavol Hell (2008) (0)
ORIENTED CIRCUIT DOUBLE COVER AND CIRCULAR FLOW AND COLOURING (2010) (0)
Asymptotic Clique Covering Ratios of Distance Graphs (2002) (0)
Generalizations of CNS and Applications (2021) (0)
Total list weighting of graphs with bounded maximum average degree (2018) (0)
The game Grundy indices of graphs (2013) (0)
DP-3-colorability of planar graphs without cycles of length 4, 7 or 9 (2023) (0)
$2$-Reconstructibility of Weakly Distance-Regular Graphs (2022) (0)
Circular flows in mono-directed signed graphs (2022) (0)
3‐Degenerate induced subgraph of a planar graph (2020) (0)
The game chromatic number of graphs Xuding Zhu (1999) (0)
Decomposition of triangle-free planar graphs (2022) (0)
Coloring, sparseness and girth (2016) (0)
Circular total chromatic numbers of graphs (2016) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Xuding Zhu?

Xuding Zhu is affiliated with the following schools: