| 2009 |
|---|
| 83 | EE | Mickaël Montassier,
André Raspaud,
Xuding Zhu:
An upper bound on adaptable choosability of graphs.
Eur. J. Comb. 30(2): 351-355 (2009) |
| 82 | EE | Xuding Zhu:
Bipartite subgraphs of triangle-free subcubic graphs.
J. Comb. Theory, Ser. B 99(1): 62-83 (2009) |
| 2008 |
|---|
| 81 | EE | 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) |
| 80 | EE | Daphne Der-Fen Liu,
Xuding Zhu:
Coloring the Cartesian sum of graphs.
Discrete Mathematics 308(24): 5928-5936 (2008) |
| 79 | EE | Jiaojiao Wu,
Xuding Zhu:
The 6-relaxed game chromatic number of outerplanar graphs.
Discrete Mathematics 308(24): 5974-5980 (2008) |
| 78 | EE | Zhishi Pan,
Xuding Zhu:
Minimal circular-imperfect graphs of large clique number and large independence number.
Eur. J. Comb. 29(4): 1055-1063 (2008) |
| 77 | EE | Pavol Hell,
Xuding Zhu:
On the adaptable chromatic number of graphs.
Eur. J. Comb. 29(4): 912-921 (2008) |
| 76 | EE | Daqing Yang,
Xuding Zhu:
Activation strategy for asymmetric marking games.
Eur. J. Comb. 29(5): 1123-1132 (2008) |
| 75 | EE | 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) |
| 74 | EE | Xuding Zhu:
Refined activation strategy for the marking game.
J. Comb. Theory, Ser. B 98(1): 1-18 (2008) |
| 73 | EE | Douglas B. West,
Xuding Zhu:
Circular chromatic index of Cartesian products of graphs.
Journal of Graph Theory 57(1): 7-18 (2008) |
| 72 | EE | Serguei Norine,
Tsai-Lien Wong,
Xuding Zhu:
Circular choosability via combinatorial Nullstellensatz.
Journal of Graph Theory 59(3): 190-204 (2008) |
| 71 | EE | Xuding Zhu:
Game coloring the Cartesian product of graphs.
Journal of Graph Theory 59(4): 261-278 (2008) |
| 70 | EE | Alexandr V. Kostochka,
Xuding Zhu:
Adapted List Coloring of Graphs and Hypergraphs.
SIAM J. Discrete Math. 22(1): 398-408 (2008) |
| 2007 |
|---|
| 69 | EE | Arnaud Pêcher,
Xuding Zhu:
Claw-free circular-perfect graphs.
Electronic Notes in Discrete Mathematics 29: 451-455 (2007) |
| 68 | EE | Sandi Klavzar,
Xuding Zhu:
Cartesian powers of graphs can be distinguished by two labels.
Eur. J. Comb. 28(1): 303-310 (2007) |
| 67 | EE | Gerard J. Chang,
Hung-Lin Fu,
Xuding Zhu:
Editorial note.
J. Comb. Optim. 14(2-3): 111-112 (2007) |
| 66 | EE | Tomás Kaiser,
Daniel Král,
Riste Skrekovski,
Xuding Zhu:
The circular chromatic index of graphs of high girth.
J. Comb. Theory, Ser. B 97(1): 1-13 (2007) |
| 65 | EE | André Raspaud,
Xuding Zhu:
List circular coloring of trees and cycles.
Journal of Graph Theory 55(3): 249-265 (2007) |
| 2006 |
|---|
| 64 | | Jiaojiao Wu,
Xuding Zhu:
Relaxed game chromatic number of outer planar graphs.
Ars Comb. 81: (2006) |
| 63 | EE | Arnaud Pêcher,
Xuding Zhu:
On the circular chromatic number of circular partitionable graphs.
Journal of Graph Theory 52(4): 294-306 (2006) |
| 2005 |
|---|
| 62 | EE | Arnaud Pêcher,
Annegret Wagler,
Xuding Zhu:
Three classes of minimal circular-imperfect graphs.
Electronic Notes in Discrete Mathematics 19: 9-15 (2005) |
| 61 | EE | Daphne Der-Fen Liu,
Xuding Zhu:
Coloring the Cartesian Sum of Graphs.
Electronic Notes in Discrete Mathematics 22: 305-309 (2005) |
| 60 | EE | Zhishi Pan,
Xuding Zhu:
Graphs of Large Girth with Prescribed Partial Circular Colourings.
Graphs and Combinatorics 21(1): 119-129 (2005) |
| 59 | EE | Xuding Zhu:
Circular perfect graphs.
Journal of Graph Theory 48(3): 186-209 (2005) |
| 58 | EE | Xuding Zhu:
Circular choosability of graphs.
Journal of Graph Theory 48(3): 210-218 (2005) |
| 57 | EE | Daphne Der-Fen Liu,
Xuding 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.
Journal of Graph Theory 48(4): 329-330 (2005) |
| 56 | EE | Peyman Afshani,
Mahsa Ghandehari,
Mahya Ghandehari,
Hamed Hatami,
Ruzbeh Tusserkani,
Xuding Zhu:
Circular chromatic index of graphs of maximum degree 3.
Journal of Graph Theory 49(4): 325-335 (2005) |
| 55 | EE | Daphne Der-Fen Liu,
Xuding Zhu:
Circular Distance Two Labeling and the lambda-Number for Outerplanar Graphs.
SIAM J. Discrete Math. 19(2): 281-293 (2005) |
| 54 | EE | Daphne Der-Fen Liu,
Xuding Zhu:
Multilevel Distance Labelings for Paths and Cycles.
SIAM J. Discrete Math. 19(3): 610-621 (2005) |
| 53 | EE | Hong-Gwa Yeh,
Xuding Zhu:
Resource-sharing system scheduling and circular chromatic number.
Theor. Comput. Sci. 332(1-3): 447-460 (2005) |
| 2004 |
|---|
| 52 | EE | Wenjie He,
Jiaojiao Wu,
Xuding Zhu:
Relaxed game chromatic number of trees and outerplanar graphs.
Discrete Mathematics 281(1-3): 209-219 (2004) |
| 51 | EE | Mohammad Hosseini Dolama,
Eric Sopena,
Xuding Zhu:
Incidence coloring of k-degenerated graphs.
Discrete Mathematics 283(1-3): 121-128 (2004) |
| 50 | EE | Hossein Hajiabolhassan,
Xuding Zhu:
Sparse H-Colourable Graphs of Bounded Maximum Degree.
Graphs and Combinatorics 20(1): 65-71 (2004) |
| 49 | EE | Jaroslav Nesetril,
Xuding Zhu:
On sparse graphs with given colorings and homomorphisms.
J. Comb. Theory, Ser. B 90(1): 161-172 (2004) |
| 48 | EE | Zhishi Pan,
Xuding Zhu:
Density of the circular chromatic numbers of series-parallel graphs.
Journal of Graph Theory 46(1): 57-68 (2004) |
| 47 | EE | Daphne Der-Fen Liu,
Xuding Zhu:
Fractional chromatic number and circular chromatic number for distance graphs with large clique size.
Journal of Graph Theory 47(2): 129-146 (2004) |
| 46 | EE | W. R. Chen,
Frank K. Hwang,
Xuding Zhu:
Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks.
SIAM J. Discrete Math. 17(3): 446-452 (2004) |
| 2003 |
|---|
| 45 | | Daphne Der-Fen Liu,
Xuding Zhu:
Circulant Distant Two Labeling and Circular Chromatic Number.
Ars Comb. 69: (2003) |
| 44 | EE | Chun-Yen Chou,
Wei-Fan Wang,
Xuding Zhu:
Relaxed game chromatic number of graphs.
Discrete Mathematics 262(1-3): 89-98 (2003) |
| 43 | EE | Sheng-Chyang Liaw,
Zhishi Pan,
Xuding Zhu:
Construction of Kn-minor free graphs with given circular chromatic number.
Discrete Mathematics 263(1-3): 191-206 (2003) |
| 42 | EE | Xuding Zhu:
Circular chromatic numbers of a class of distance graphs.
Discrete Mathematics 265(1-3): 337-350 (2003) |
| 41 | EE | Ko-Wei Lih,
Wei-Fan Wang,
Xuding Zhu:
Coloring the square of a K4-minor free graph.
Discrete Mathematics 269(1-3): 303-309 (2003) |
| 40 | EE | Hong-Gwa Yeh,
Xuding Zhu:
4-Colorable 6-regular toroidal graphs.
Discrete Mathematics 273(1-3): 261-274 (2003) |
| 39 | EE | Xuding Zhu:
An Analogue of Hajós' Theorem for the Circular Chromatic Number (II).
Graphs and Combinatorics 19(3): 419-432 (2003) |
| 38 | EE | Hossein Hajiabolhassan,
Xuding Zhu:
Circular chromatic number of Kneser graphs.
J. Comb. Theory, Ser. B 88(2): 299-303 (2003) |
| 2002 |
|---|
| 37 | EE | Claude Tardif,
Xuding Zhu:
The level of nonmultiplicativity of graphs.
Discrete Mathematics 244(1-3): 461-471 (2002) |
| 36 | EE | Zhishi Pan,
Xuding Zhu:
The circular chromatic number of series-parallel graphs of large odd girth.
Discrete Mathematics 245(1-3): 235-246 (2002) |
| 35 | EE | Frank K. Hwang,
Xuding Zhu:
Preface.
Discrete Mathematics 253(1-3): 1- (2002) |
| 34 | EE | Claude Tardif,
Xuding Zhu:
On Hedetniemi's conjecture and the colour template scheme.
Discrete Mathematics 253(1-3): 77-85 (2002) |
| 33 | EE | Zhishi Pan,
Xuding Zhu:
Tight relation between the circular chromatic number and the girth of series-parallel graphs.
Discrete Mathematics 254(1-3): 393-404 (2002) |
| 32 | EE | Daphne Der-Fen Liu,
Xuding Zhu:
Asymptotic Clique Covering Ratios of Distance Graphs.
Eur. J. Comb. 23(3): 315-327 (2002) |
| 31 | EE | Xuding Zhu:
Circular Colouring and Orientation of Graphs.
J. Comb. Theory, Ser. B 86(1): 109-113 (2002) |
| 2001 |
|---|
| 30 | EE | Xuding Zhu:
Circular chromatic number: a survey.
Discrete Mathematics 229(1-3): 371-410 (2001) |
| 29 | EE | Jaroslav Nesetril,
Xuding Zhu:
Construction of sparse graphs with prescribed circular colorings.
Discrete Mathematics 233(1-3): 277-291 (2001) |
| 28 | EE | Xuding Zhu:
Circular Chromatic Number of Planar Graphs of Large Odd Girth.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 27 | | Gerard J. Chang,
Xuding Zhu:
Pseudo-Hamiltonian-connected graphs.
Discrete Applied Mathematics 100(3): 145-153 (2000) |
| 26 | EE | Xuding Zhu:
The game coloring number of pseudo partial k-trees.
Discrete Mathematics 215: 245-262 (2000) |
| 1999 |
|---|
| 25 | EE | Xuding Zhu:
Graphs Whose Circular Chromatic Number Equals the Chromatic Number.
Combinatorica 19(1): 139-149 (1999) |
| 24 | EE | Thomas Dinski,
Xuding Zhu:
A bound for the game chromatic number of graphs.
Discrete Mathematics 196(1-3): 109-115 (1999) |
| 23 | EE | Gerard J. Chang,
Lingling Huang,
Xuding Zhu:
Circular chromatic numbers of Mycielski's graphs.
Discrete Mathematics 205(1-3): 23-37 (1999) |
| 22 | EE | Xuding Zhu:
The Game Coloring Number of Planar Graphs.
J. Comb. Theory, Ser. B 75(2): 245-258 (1999) |
| 21 | EE | Gerard J. Chang,
Daphne Der-Fen Liu,
Xuding Zhu:
Distance Graphs and T-Coloring.
J. Comb. Theory, Ser. B 75(2): 259-269 (1999) |
| 20 | EE | Xuding Zhu:
Planar Graphs with Circular Chromatic Numbers between 3 and 4.
J. Comb. Theory, Ser. B 76(2): 170-200 (1999) |
| 19 | EE | Ko-Wei Lih,
Daphne Der-Fen Liu,
Xuding Zhu:
Star Extremal Circulant Graphs.
SIAM J. Discrete Math. 12(4): 491-499 (1999) |
| 1998 |
|---|
| 18 | EE | Xuding Zhu:
Chromatic Ramsey numbers.
Discrete Mathematics 190(1-3): 215-222 (1998) |
| 17 | EE | Gerard J. Chang,
Lingling Huang,
Xuding Zhu:
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs.
Eur. J. Comb. 19(4): 423-431 (1998) |
| 16 | EE | Xuding Zhu:
Pattern Periodic Coloring of Distance Graphs.
J. Comb. Theory, Ser. B 73(2): 195-206 (1998) |
| 15 | EE | D. J. Guan,
Xuding Zhu:
Multiple Capacity Vehicle Routing on Paths.
SIAM J. Discrete Math. 11(4): 590-602 (1998) |
| 1997 |
|---|
| 14 | | Xuding Zhu:
A note on graph reconstruction.
Ars Comb. 46: (1997) |
| 13 | | Huishan Zhou,
Xuding Zhu:
Multiplicativity of Acyclic Local Tournaments.
Combinatorica 17(1): 135-145 (1997) |
| 12 | EE | Walter A. Deuber,
Xuding Zhu:
The chromatic numbers of distance graphs.
Discrete Mathematics 165-166: 195-204 (1997) |
| 11 | EE | D. J. Guan,
Xuding Zhu:
A Coloring Problem for Weighted Graphs.
Inf. Process. Lett. 61(2): 77-81 (1997) |
| 1996 |
|---|
| 10 | | Eckhard Steffen,
Xuding Zhu:
Star Chromatic Numbers of Graphs.
Combinatorica 16(3): 439-448 (1996) |
| 9 | EE | Pavol Hell,
Jaroslav Nesetril,
Xuding Zhu:
Complexity of Tree Homomorphisms.
Discrete Applied Mathematics 70(1): 23-36 (1996) |
| 8 | EE | Guogang Gao,
Xuding Zhu:
Star-extremal graphs and the lexicographic product.
Discrete Mathematics 152(1-3): 147-156 (1996) |
| 7 | EE | Xuding Zhu:
On the bounds for the ultimate independence ratio of a graph.
Discrete Mathematics 156(1-3): 229-236 (1996) |
| 1995 |
|---|
| 6 | | Xuding Zhu:
A Polynomial Algorithm for Homomorphisms to Oriented Cycles.
J. Algorithms 19(3): 333-345 (1995) |
| 5 | EE | Pavol Hell,
Xuding Zhu:
The Existence of Homomorphisms to Oriented Cycles.
SIAM J. Discrete Math. 8(2): 208-222 (1995) |
| 1994 |
|---|
| 4 | EE | Pavol Hell,
Xuding Zhu:
Homomorphisms to oriented paths.
Discrete Mathematics 132(1-3): 107-114 (1994) |
| 3 | EE | Pavol Hell,
Huishan Zhou,
Xuding Zhu:
Multiplicativity of Oriented Cycles.
J. Comb. Theory, Ser. B 60(2): 239-253 (1994) |
| 1993 |
|---|
| 2 | | Pavol Hell,
Huishan Zhou,
Xuding Zhu:
Homomorphisms to oriented cycles.
Combinatorica 13(4): 421-433 (1993) |
| 1992 |
|---|
| 1 | EE | Xuding Zhu:
A simple proof of the multiplicativity of directed cycles of prime power length.
Discrete Applied Mathematics 36(3): 313-316 (1992) |
