Game chromatic number of outerplanar graphs

Journal of Graph Theory

Volumn 30, Issue 1, 1999, Pages 67-70

  Guan, D J ^a   Zhu, Xuding ^a  

^a NONE

Author keywords

2 tree; Game chromatic number; Outerplanar graph

Indexed keywords

EID: 0033477109     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199901)30:1<67::AID-JGT7>3.0.CO;2-M     Document Type: Article

References (7)

1. H. L. Bodlaender, On the complexity of some coloring games, Internat J Foundations Comp Sci 2 (1991), 133-147.
2. T. Dinski and Xuding Zhu, Game chromatic number of graphs, Discrete Math, to appear.
3. U. Faigle, U. Kern, H. Kierstead, and W. T. Trotter, On the game chromatic number of some classes of graphs, Ars Comb 35 (1993), 143-158.
4. H. A. Kierstead and W. T. Trotter, Planar graph coloring with an uncooperative partner, J Graph Theory, 18 (1994), 569-584.
5. X. Zhu, Game coloring number of planar graphs, J Combin Theory, to appear.
6. X. Zhu, Game coloring number of chordal graphs, Preprint, 1998.
7. X. Zhu, Game coloring number of pseudo partial k-trees, Preprint, 1998.