A bound for the game chromatic number of graphs

Discrete Mathematics

Volumn 196, Issue 1-3, 1999, Pages 109-115

  Dinski, Thomas ^a   Zhu, Xuding ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Acyclic chromatic number; Game chromatic number; Partial k tree; Planar graph

Indexed keywords

EID: 0038621187     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00197-6     Document Type: Article

References (11)

1. M.O. Albertson, D.M. Berman, An acyclic analogue to Heawood's theorem, Glasgow Math. J. 19 (1978) 163-166.
2. H.L. Bodlaender, On the complexity of some coloring games, Proceedings of the WG 1990 Workshop on Graph Theoretical Concepts in Computer Science, 1990, pp. 30-40.
3. O.V. Borodin, On acyclic colorings of planar graphs, Discrete Math. 25 (1979) 211-236.
4. U. Faigle, U. Kern, H. Kierstead, W.T. Trotter, On the game chromatic number of some classes of graphs, Ars Combin. 35 (1993) 143-150.
5. B. Grünbaum, Acyclic colorings of planar graphs, Israel J. Math. 14 (1973) 390-408.
6. H.A. Kierstead, W.T. Trotter, W.T. Planar graph coloring with an uncooperative partner, J. Graph Theory 18(6) (1994) 569-584.
7. A.V. Kostochka, E. Sopena, X. Zhu, Acyclic chromatic numbers of graphs, J. Graph Theory 24 (1997) 331-340.
8. E. Sopena, The chromatic number of oriented graphs, J. Graph Theory 25 (1997) 191-205.
9. X. Zhu, The game coloring number of planar graphs, J. Combin. Theory Ser. B, to appear.
10. X. Zhu, Game coloring number of pseudo partial k-trees, preprint, 1998.
11. D. Guan, X. Zhu, Game chromatic number of outerplanar graphs, J. Graph Theory, to appear.