Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Chung-Ying Yang
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
Adapted game colouring of graphs
2011
H. A. Kierstead
Chung-Ying Yang
Daqing Yang
Xuding Zhu
+
PDF
Chat
Cycle Adjacency of Planar Graphs and 3-Colourability
2011
Chung-Ying Yang
Xuding Zhu
+
CIRCULAR CONSECUTIVE CHOOSABILITY OF GRAPHS
2008
Wensong Lin
Daqing Yang
Chung-Ying Yang
Xuding Zhu
Common Coauthors
Coauthor
Papers Together
Xuding Zhu
3
Daqing Yang
2
Wensong Lin
1
H. A. Kierstead
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
A Few Remarks on Orientation of Graphs and Ramsey Theory
1989
M. Cochand
Pierre Duchet
1
+
The State of the Three Color Problem
1993
Richard Steinberg
1
+
On acyclic colorings of planar graphs
2006
O. V. Borodin
1
+
Orderings on Graphs and Game Coloring Number
2003
H. A. Kierstead
Daqing Yang
1
+
On the upper chromatic numbers of the reals
2000
Aaron Archer
1
+
PDF
Chat
Grad and classes with bounded expansion I. Decompositions
2007
Jaroslav Nešetřil
Patrice Ossona de Mendez
1
+
On the adaptable chromatic number of graphs
2008
Pavol Hell
Xuding Zhu
1
+
Ramsey properties of orientations of graphs
1993
Graham Brightwell
Yoshiharu Kohayakawa
1
+
PDF
Chat
Efficient Graph Packing via Game Colouring
2009
H. A. Kierstead
Alexandr Kostochka
1
+
Game chromatic number of outerplanar graphs
1999
D.J. Guan
Xuding Zhu
1
+
Graphs with Linearly Bounded Ramsey Numbers
1993
G.T. Chen
R. H. Schelp
1
+
Circular choosability of graphs
2005
Xuding Zhu
1
+
None
2008
Vojtěch Rödl
J Zich
1
+
Homomorphisms from sparse graphs with large girth
2003
O. V. Borodin
S.-J. Kim
Alexandr Kostochka
Douglas B. West
1
+
Chromatic capacities of graphs and hypergraphs
2004
Joshua Evan Greene
1
+
PDF
Chat
On Two Conjectures on Packing of Graphs
2005
Béla Bollobás
Alexandr Kostochka
Kittikorn Nakprasit
1
+
High-Girth Graphs Avoiding a Minor are Nearly Bipartite
2001
Anna Galluccio
Luis Goddyn
Pavol Hell
1
+
(2 + ε)-Coloring of planar graphs with large odd-girth
2000
William F. Klostermeyer
Cun Quan Zhang
1
+
Generalization of transitive fraternal augmentations for directed graphs and its applications
2009
Daqing Yang
1
+
Relaxed game chromatic number of graphs
2003
Chun-Yen Chou
Weifan Wang
Xuding Zhu
1
+
A simple competitive graph coloring algorithm III
2004
Charles L. Dunn
H. A. Kierstead
1
+
Planar graph coloring with an uncooperative partner
1994
H. A. Kierstead
W. T. Trotter
1
+
Game-perfect digraphs
2012
Stephan Dominique Andres
1
+
PDF
Chat
Structural Properties of Sparse Graphs
2008
Jaroslav Nešetřil
Patrice Ossona de Mendez
1
+
Star chromatic number
1988
Andrew Vince
1
+
Refined activation strategy for the marking game
2007
Xuding Zhu
1
+
An upper bound on adaptable choosability of graphs
2008
Mickaël Montassier
André Raspaud
Xuding Zhu
1
+
Colouring graphs with bounded generalized colouring number
2008
Xuding Zhu
1
+
None
2009
1
+
The Map-Coloring Game
2007
Tomasz Bartnicki
Jarosław Grytczuk
H. A. Kierstead
Xuding Zhu
1
+
PDF
Chat
On the Oriented Game Chromatic Number
2000
Jaroslav Nešetřil
Éric Sopena
1
+
On acyclic colorings of planar graphs
1979
O. V. Borodin
1
+
A Simple Competitive Graph Coloring Algorithm
2000
H. A. Kierstead
1
+
Game chromatic number of outerplanar graphs
1999
D.J. Guan
Xuding Zhu
1
+
PDF
Chat
Game coloring the Cartesian product of graphs
2008
Xuding Zhu
1
+
Adapted list coloring of planar graphs
2009
Louis Esperet
Mickaël Montassier
Xuding Zhu
1
+
Game-perfect graphs
2008
Stephan Dominique Andres
1
+
Fractional graph theory
1978
Claude Berge
1