The Relaxed Game Chromatic Number of Outerplanar Graphs

Journal of Graph Theory

Volumn 46, Issue 1, 2004, Pages 69-78

  Dunn, Charles ^a   Kierstead, Hal A ^b  

^a LINFIELD COLLEGE   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Competitive coloring; Outerplanar graph; Relaxed coloring

Indexed keywords

SET THEORY; THEOREM PROVING;

CHROMATIC NUMBER; COMPETITIVE COLORING; OUTERPLANAR GRAPH; RELAXED COLORING;

GRAPH THEORY;

EID: 2342459065     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10172     Document Type: Article

References (16)

1. H. L. Bodlaender, On the complexity of some relaxed coloring games, In: R. H. Möhring, editor, Graph theoretical concepts in computer science, Vol. 484 of Lecture notes in computer science, Springer-Verlag, New York (1991), 30-40.
2. C. Chou, W. Wang, and X. Zhu, Relaxed game chromatic number of graphs, Discrete Math 262 (2003), 89-98.
3. L. J. Cowen, R. H. Cowen, and D. R. Woodall, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, J Graph Theory 10 (1986), 187-195.
4. L. Cai and X. Zhu, Game chromatic index of k-degenerate graphs, J of Graph Theory 36 (2001), 144-155.
5. T. Dinski and X Zhu, A bound for the game chromatic number of graphs, Discrete Math 196 (1999), 109-115.
6. C. Dunn and H. A. Kierstead, A simple competitive graph coloring algorithm II, J Combinatorial Theory (B), accepted.
7. C. Dunn and H. A. Kierstead, A simple competitive graph coloring algorithm III, submitted (2001).
8. U. Faigle, W. Kern, H. A. Kierstead, and W. T. Trotter, On the game chromatic number of some classes of graphs, Ars Combinat 35 (1993), 143-150.
9. D. Guan and X. Zhu, Game chromatic number of outerplanar graphs, J Graph Theory 30 (1999), 67-70.
10. H. A. Kierstead, A simple competitive graph coloring algorithm, J Combin Theory (B) 78 (2000), 57-68.
11. H. A. Kierstead and W. T. Trotter, Planar graph coloring with an uncooperative partner, J Graph Theory 18 (1994), 569-584.
12. H. A. Kierstead and W. T. Trotter, Competitive colorings of oriented graphs, Electronic J Combin 12 (2001), 12, 15 (Electronic).
13. H. A. Kierstead and Zs. Tuza, Marking games and the oriented game chromatic number of partial k-trees, Graphs Combin 8 (2003), 121-129.
14. J. Nešetřil and E. Sopena, On the oriented game chromatic number, Electronic J Combin 14 (2001), 13 (Electronic).
15. X. Zhu, Game coloring number of planar graphs, J Combin Theory (B) 75 (1999), 245-258.
16. X. Zhu, The game coloring number of pseudo partial k-trees, Discrete Math 215 (2000), 245-262.