Marking games and the oriented game chromatic number of partial k-trees

Graphs and Combinatorics

Volumn 19, Issue 1, 2003, Pages 121-129

  Kierstead, H A ^a   Tuza, Zs ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF PANNONIA   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038576886     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-002-0489-5     Document Type: Article

References (19)

1. Biró, M., Hujter, M., Tuza, Zs.: Precoloring extension. I. Interval graphs. Discrete Math. 100, 267-279 (1992)
2. Bodlaender, H.L.: On the complexity of some coloring games. In: R.H. Möhring: Graph Theoretical concepts in Computer Science Lect. Notes Comput. Sci. vol. 484, pp. (30-40) Springer-Verlag, 1991
3. Buneman, P.: A characterization of rigid circuit graphs. Discrete Math. 9, 205-212 (1974)
4. Cai, L., Zhu, X.: Game chromatic index of k-degenerate graphs. J. Graph Theory 36, 144-155 (2001)
5. Dinski, T., Zhu, X.: Game chromatic number of graphs. Discrete Math. 196, 109-115 (1999)
6. Faigle, U., Kern, U., Kierstead, H.A., Trotter, W.T.: On the game chromatic number of some classes of graphs. Ars Comb. 35, 143-150 (1993)
7. Gavril, F.: The intersection graphs of subtrees of a tree are exactly the chordal graphs. J. Comb. Theory, ser. B 16, 477-495 (1974)
8. Guan, D.J., Zhu, X.: Game chromatic number of outerplanar graphs. J. Graph Theory 30, 67-70 (1999)
9. Harary, F., Tuza, Zs.: Two graph-colouring games. Bull. Aust. Math. Soc. 48, 141-149 (1993)
10. Hujter, M., Tuza, Zs.: Precoloring extension. II. Graph classes related to bipartite graphs. Acta Math. Univ. Carolinae 62, 1-11 (1993)
11. Hujter, M., Tuza, Zs.: Precoloring extension. III. Classes of perfect graphs. Comb. Probab. Comput. 5, 35-56 (1996)
12. Kierstead, H.A.: A simple competitive graph coloring algorithm. J. Comb. Theory, ser. B 78, 57-68 (2000)
13. Kierstead, H.A., Trotter, W.T.: Planar graph coloring with an uncooperative partner. J. Graph Theory 18, 569-584 (1994)
14. Kierstead, H.A., Trotter, W.T.: Competitive colorings of oriented graphs. In honor of Aviezri Fraenkel on the occasion of his 70th birthday. (Research Paper 12, 15 pp. (electronic)) Electron. J. Comb. 8, (2001)
15. Kierstead, H.A., Tuza, Zs.: Game chromatic number and tree width. (1995) (unpublished)
16. Nešetřil, J., Sopena, E.: On the oriented game chromatic number. In honor of Aviezri Fraenkel on the occasion of his 70th birthday. (Research Paper 14, 13 pp. (electronic)) Electron. J. Comb. 8, (2001)
17. Walter, J.R.: Representations of chordal graphs as subtrees of a tree. J. Graph Theory 2, 265-267 (1978)
18. Zhu, X.: Game coloring number of planar graphs. J. Comb. Theory, ser. B 75, 245-258 (1999)
19. Zhu X.: Game coloring number of pseudo partial k-trees. Discrete Math. 215, 245-262 (2000)