Relaxed game chromatic number of trees and outerplanar graphs

Discrete Mathematics

Volumn 281, Issue 1-3, 2004, Pages 209-219

  He, Wenjie ^a   Wu, Jiaojiao ^b   Zhu, Xuding ^b  

^a HEBEI UNIVERSITY OF TECHNOLOGY   (China)

^b NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Defective chromatic number; Improper chromatic number; Outerplanar graph; Relaxed chromatic number; Relaxed game chromatic number; Tree

Indexed keywords

GAME THEORY; INTEGER PROGRAMMING; NUMBER THEORY; PROBLEM SOLVING; THEOREM PROVING;

DEFECTIVE CHROMATIC NUMBER; IMPROPER CHROMATIC NUMBER; OUTERPLANAR GRAPH; RELAXED CHROMATIC NUMBER; RELAXED GAME CHROMATIC NUMBER;

TREES (MATHEMATICS);

EID: 1842615982     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.08.006     Document Type: Article

References (10)

1. Bodlaender H.L. On the complexity of some coloring games. Internat. J. Foundations of Comput. Sci. 2:1991;133-148.
2. Cai L., Zhu X. Game chromatic index of. k -degenerate graphs J. Graph Theory. 36:2001;144-155.
3. J. Chou, W. Wang, X. Zhu, Relaxed game chromatic number of graphs, Discrete Math., to appear.
4. Dunn, Kierstead, A simple competitive graph coloring algorithm II, Manuscript, 2000.
5. 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.
6. Guan D., Zhu X. The game chromatic number of outerplanar graphs. J. Graph Theory. 30:1999;67-70.
7. Kierstead H.A. A simple competitive graph coloring algorithm. J. Combin. Theory B. 78:2000;57-68.
8. Kierstead H.A., Trotter W.T. Planar graph coloring with an uncooperative partner. J. Graph Theory. 18(6):1994;569-584.
9. Zhu X. The game coloring number of planar graphs. J. Combin. Theory B. 75:1999;245-258.
10. Zhu X. Game coloring number of pseudo partial. k -trees Discrete Math. 215:2000;245-262.