Edge-partitions of planar graphs and their game coloring numbers

Journal of Graph Theory

Volumn 41, Issue 4, 2002, Pages 307-317

  He, Wenjie ^a   Hou, Xiaoling ^a   Lih, Ko Wei ^b   Shao, Jiating ^a   Wang, Weifan ^c   Zhu, Xuding ^d  

^a HEBEI UNIVERSITY OF TECHNOLOGY   (China)

^b INSTITUTE OF MATHEMATICS   (Taiwan)

^c LIAONING UNIVERSITY   (China)

^d NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Decomposition; Game chromatic number; Game coloring number; Girth; Light edge; Planar graph

Indexed keywords

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

References (17)

1. 1 H. L. Bodlaender, On the complexity of some coloring games, Interat J Found Comput Sci 2 ( 1991), 133–147.
2. 2 O. V. Borodin, On the total coloring of planar graphs, J reine angew Math 394 ( 1989), 180–185.
3. 3 O. V. Borodin, A generalization of Kotzig's theorem and prescribed edge coloring of planar graphs, Math Notes Acad Sci USSR 48 ( 1990), 1186–1190.
4. 4 O. V. Borodin, Structural theorem on plane graphs with application to the entire coloring number, J Graph Theory 23 ( 1996), 233–239.
5. 5 G. Chartrand, D. P. Geller, and S. Hedetniemi, Graphs with forbidden subgraphs, J Combin Theory Ser B 10 ( 1971), 12–41.
6. 6 T. Dinski and X. Zhu, A bound for the game chromatic number of graphs, Discrete Math 196 ( 1999), 109–115.
7. 7 U. Faigle, U. Kern, H. A. Kierstead, and W. T. Trotter, On the game chromatic number of some classes of graphs, Ars Combin 35 ( 1993), 143–150.
8. 8 D. Guan and X. Zhu, The game chromatic number of outerplanar graphs, J Graph Theory 30 ( 1999), 67–70.
9. 9 G. R. Kampen, Orienting planar graphs, Discrete Math 14 ( 1976), 337–341.
10. 10 K. Kedlaya, Outerplanar partitions of planar graphs, J Combin Theory Ser B 67 ( 1996), 238–248.
11. 11 H. A. Kierstead and W. T. Trotter, Planar graph coloring with an uncooperative partner, J Graph Theory 18 ( 1994), 569–584.
12. 12 H. A. Kierstead, A simple competitive graph coloring algorithm, J Combin Theory Ser B 78 ( 2000), 57–68.
13. 13 A. Kotzig, Contribution to the theory of Eulerian polyhedra, Mat Čas 13 ( 1963), 20–34 (in Russian).
14. 14 C. St. J. A. Nash‐Williams, Edge‐disjoint spanning trees of finite graphs, J London Math Soc 36 ( 1961), 445–450.
15. 15 G. Ringel, Two trees in maximal planar bipartite graph, J Graph Theory 17 ( 1993), 755–758.
16. 16 J. L. Wu, On the linear arboricity of planar graphs, J Graph Theory 31 ( 1999), 129–134.
17. 17 X. Zhu, The game coloring number of planar graphs, J Combin Theory Ser B 75 ( 1999), 245–258.