Competitive colorings of oriented graphs

Electronic Journal of Combinatorics

Volumn 8, Issue 2 R, 2001, Pages 1-15

  Kierstead, H A ^a   Trotter, W T ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Chromatic number; Competitive algorithm; Oriented graph

Indexed keywords

EID: 4043083333     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. H. L. Bodlaender, On the complexity of some coloring games, Internat. J. Found. Comput. Sci. 2 (1991), 133-147.
2. L. Cai and X. Zhu, Game coloring index and game chromatic index of graphs, manuscript, 1998.
3. Chen and Schelp, Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Series B 57 (1993), 138-149.
4. T. Dinski and X. Zhu, Game chromatic number of graphs, Discrete Mathematics, to appear.
5. U. Faigle, U. Kern, H. A. Kierstead, and W. T. Trotter, On the game chromatic number of some classes of graphs, Ars Combinatorica, 35 (1993), 143-150.
6. D. Guan and X. Zhu, The game chromatic number of outerplanar graphs, J. Graph Theory, to appear.
7. H. A. Kierstead, A simple competitive graph coloring algorithm, J. Combin. Theory Ser. B 78 (2000), 57-68.
8. H. A. Kierstead and Z. Tuza, Game chromatic number and treewidth, manuscript, 1996.
9. H. A. Kierstead and W. T. Trotter, Planar graph coloring with an uncooperative partner, J. Graph Theory 18 (1994), 569-584.
10. J. Nešetřil and E. Sopena, On the oriented game chromatic number, The Electr. J. Comb. 8(2) (2001) R14.
11. X. Zhu, The game coloring number of planar graphs, J. Comb. Theory, Series B 75 (1999), 245-258. His first paper.
12. X. Zhu, The game coloring number of pseudo partial k-trees, manuscript (1999).