Orderings on graphs and game coloring number

Order

Volumn 20, Issue 3, 2003, Pages 255-264

  Kierstead, H A ^a   Yang, Daqing ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

K coloring number; K game coloring number; Planar graphs

Indexed keywords

EID: 3543022760     PISSN: 01678094     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:ORDE.0000026489.93166.cb     Document Type: Article

References (14)

1. Alon, N.: Restricted colorings of graphs, In: K. Walker (ed.), Surveys in Combinatorics (Proc. 14th British Combinatorial Conf.), Cambridge Univ. Press, Cambridge, 1993, pp. 1-33.
2. Bollobás, B. and Thomason, A. G.: Proof of a conjecture of Mader, Erdos, and Hajnal on topological complete subgraphs, Manuscript, 1994.
3. Chen and Schelp: Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B 57 (1993), 138-149.
4. Dinski, T. and Zhu, X.: A bound for the game chromatic number of graphs, Discrete Math. 196 (1999), 109-115.
5. Faigle, U., Kern, W., Kierstead, H. A. and Trotter, W. T.: On the game chromatic number of some classes of graphs, Ars Combin. 35 (1993), 143-150.
6. Kierstead, H. A.: A simple competitive graph coloring algorithm, J. Combin. Theory (B) 78 (2000), 57-68.
7. Kierstead, H. A.: Weak Acyclic Coloring and Asymmetric Coloring Games, Manuscript, 2002.
8. Kierstead, H. A. and Trotter, W. T.: Planar graph coloring with an uncooperative partner, J. Graph Theory 18 (1994), 569-584.
9. Kierstead, H. A. and Trotter, W. T.: Competitive colorings of oriented graphs. In honor of Aviezri Fraenkel on the occasion of his 70th birthday, Electron. J. Combin. 8 (2001), Research Paper 12, 15 pp. (electronic).
10. Kierstead, H. A. and Tuza, Zs.: Marking games and the oriented game chromatic number of partial k-trees, Graphs and Combinatorics (2003), 121-129.
11. Komlós, J. and Szemerédi, E.: Topological cliques in graphs II, Combinatorics, Probability, and Computing 5 (1996), 79-90.
12. Nešetřil, J. and Sopena, E.: On the oriented game chromatic number. In honor of Aviezri Fraenkel on the occasion of his 70th birthday, Electron. J. Combin. 8 (2001), Research Paper 14, 13 pp. (electronic).
13. Zhu, X.: Game coloring number of planar graphs, J. Combin. Theory (B) 75 (1999), 245-258.
14. Zhu, X.: The game coloring number of pseudo partial k-trees, Discrete Math. 215 (2000), 245-262.