The Game Coloring Number of Planar Graphs

Journal of Combinatorial Theory. Series B

Volumn 75, Issue 2, 1999, Pages 245-258

  Zhu, Xuding ^a  

^a NONE

Author keywords

Back degree; Coloring number; Decomposition; Game chromatic number; Game coloring number; Light edge; Linear order; Planar graph

Indexed keywords

EID: 0038621143     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1878     Document Type: Article

References (21)

1. Albertson M. O., Berman D. M. An acyclic analogue to Heawood's theorem. Glasgow Math. J. 19:1978;163-166.
2. Bodlaender H. L. On the complexity of some coloring games. Graph Theoretic Concepts in Computer Science. Lecture Notes in Comput. Sci. 484:1991;Springer-Verlag, Berlin/New York. p. 30-40.
3. Borodin O. V. A generalization of Kotzig's theorem and prescribed edge coloring of planar graphs. Math. Notes Acad. Sci. USSR. 48:1990;1186-1190.
4. Borodin O. V. On acyclic colorings of planar graphs. Discrete Math. 25:1979;211-236.
5. Borodin O. V. Structural properties of planar maps with minimum degree 5. Math. Nachr. 158:1992;109-117.
6. Borodin O. V., Sanders D. P. On light edges and triangles in planar graphs of minimum degree five. Math. Nachr. 170:1994;19-24.
7. T. Dinski, X. Zhu, Game chromatic number of graphs, Discrete Math.
8. Erdos P., Hajnal A. On chromatic number of graphs and set systems. Acta Math. Acad. Sci. Hungar. 17:1996;61-19.
9. Faigle U., Kern U., Kierstead H., Trotter W. T. On the game chromatic number of some classes of graphs. Ars Combin. 35:1993;143-150.
10. Finck H.-J., Sachs H. Über eine von H. S. Wilf angegebene Schranke für die chromatiche Zahl endlicher Graphen. Math. Nachr. 39:1969;373-386.
11. D. Guan, X. Zhu, The game chromatic number of outerplanar graphs, J. Graph Theory.
12. Halin R. Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatiche Zahl. Abh. Math. Sem. Univ. Hamburg. 31:1967;156-165.
13. Matula A. W. A min-max theorem for graphs with application to graph coloring. SIAM Rev. 10:1968;481-482.
14. Jensen T., Toft B. Graph Coloring Problems. 1995;Wiley, New York.
15. Kierstead H. A., Trotter W. T. Planar graph coloring with an uncooperative partner. J. Graph Theory. 18:1994;569-584.
16. Kostochka A. V., Sopena E., Zhu X. Acyclic chromatic numbers of graphs. J. Graph Theory. 24:1997;331-340.
17. Kotzig A. From the theory of Euler's polyhedrons. Mat. Čas. 13:1963;20-34.
18. Lick D. R., White A. T. k. Canad. J. Math. 22:1970;1082-1096.
19. Nash-William C. St. J. A. Decomposition of finite graphs into forests. J. London Math. Soc. 39:1964.
20. Sanders D. P. On the effect of major vertices on the number of light edges. J. Graph Theory. 21:1996;317-322.
21. X. Zhu, Game coloring number of pseudo partialk, 1998.