A Simple Competitive Graph Coloring Algorithm

Journal of Combinatorial Theory. Series B

Volumn 78, Issue 1, 2000, Pages 57-68

  Kierstead, H A ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037944981     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1999.1927     Document Type: Article

References (9)

1. Bodlaender H. L. On the complexity of some coloring games. Möhring R. H. Graph Theoretical Concepts in Computer Science. Lecture Notes in Computer Science. 484:1991;30-40 Springer-Verlag, New York/Berlin.
2. L. Cai, and, X. Zhu, Game coloring index and game chromatic index of graphs, manuscript, 1998.
3. T. Dinski, and, X. Zhu, Game chromatic number of graphs, Discrete Math, in press.
4. Faigle U., Kern U., Kierstead H. A., Trotter W. T. On the game chromatic number of some classes of graphs. Ars Combin. 35:1993;143-150.
5. D. Guan, and, X. Zhu, The game chromatic number of outerplanar graphs, J. Graph Theory, in press.
6. H. A. Kierstead, and, Z. Tuza, Game chromatic number and treewidth, manuscript, 1996.
7. Kierstead H. A., Trotter W. T. Planar graph coloring with an uncooperative partner. J. Graph Theory. 18:1994;569-584.
8. X. Zhu, Game coloring number of planar graphs, J. Combin. Theory Ser. B, in press.
9. X. Zhu, Game coloring number of pseudo partial k-trees, manuscript, 1998.