Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers

Discrete Mathematics

Volumn 306, Issue 2, 2006, Pages 262-270

  Wang, Wei Fan ^a  

^a ZHEJIANG NORMAL UNIVERSITY   (China)

Author keywords

Cycle; Edge decomposition; Game coloring number; Girth; Graph of nonnegative characteristic

Indexed keywords

COLORING; GRAPH THEORY; MATHEMATICAL TECHNIQUES; NUMBER THEORY;

CYCLE; EDGE-DECOMPOSITION; GAME COLORING NUMBER; GIRTH; GRAPH OF NONNEGATIVE CHARACTERISTIC;

GAME THEORY;

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

References (18)

1. H.L. Bodlaender On the complexity of some coloring games Internat. J. Found. Comput. Sci. 2 1991 133 148
2. 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
3. O.V. Borodin Structural theorem on plane graphs with application to the entire coloring number J. Graph Theory 23 1996 233 239
4. L. Cai, and X. Zhu Game chromatic index of k-degenerate graphs J. Graph Theory 36 2001 144 155
5. C. Chou, W. Wang, and X. Zhu Relaxed game chromatic number of graphs Discrete Math. 262 2003 89 98
6. T. Dinski, and X. Zhu A bound for the game chromatic number of graphs Discrete Math. 196 1999 109 115
7. C. Dunn, and H.A. Kierstead A simple competitive graph coloring algorithm II J. Combin. Theory Ser. B 90 2004 93 106
8. C. Dunn, and H.A. Kierstead A simple competitive graph coloring algorithm III J. Combin. Theory Ser. B 92 2004 137 150
9. 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
10. B. Grunbaum, and G.C. Shephard Analogues for tilings of Kotzig's theorem on minimal weights of edges Ann. Discrete Math. 12 1982 129 140
11. D. Guan, and X. Zhu The game chromatic number of outerplanar graphs J. Graph Theory 30 1999 67 70
12. W. He, X. Hou, K.W. Lih, J. Shao, W. Wang, and X. Zhu Edge-partitions of planar graphs and their game coloring numbers J. Graph Theory 41 2002 307 317
13. W. He, J. Wu, and X. Zhu Relaxed game chromatic number of trees and outerplanar graphs Discrete Math. 281 2004 209 219
14. H.A. Kierstead A simple competitive graph coloring algorithm J. Combin. Theory Ser. B 78 2000 57 68
15. H.A. Kierstead, and W.T. Trotter Planar graph coloring with an uncooperative partner J. Graph Theory 18 1994 569 584
16. A. Kotzig Contribution to the theory of Eulerian polyhedra Mat. Čas. 13 1963 20 34 (in Russian)
17. X. Zhu The game coloring number of planar graphs J. Combin. Theory Ser. B 75 1999 245 258
18. X. Zhu The game coloring number of pseudo partial k-trees Discrete Math. 215 2000 245 262