Many graph theoretic algorithms rely on an initial ordering of the vertices of the graph which has some special properties. We discuss new ways to measure the quality of such orders, give methods for constructing high quality orders, and provide applications for these orders. While our main motivation is the study of game chromatic number, there have been other applications of these ideas and we expect there will be more.
Unable to display preview. Download preview PDF.
- 1.Alon, N.: Restricted colorings of graphs, In: K. Walker (ed.), Surveys in Comüinatorics (Proc. 14th British Comüinatorial Conf.), Camüridge Univ. Press, Camüridge, 1993, pp. 1–33.Google Scholar
- 2.Bolloüás, B. and Thomason, A. G.: Proof of a conjecture of Mader, Erdős, and Hajnal on topological complete suügraphs, Manuscript, 1994.Google Scholar
- 7.Kierstead, H. A.: Weak Acyclic Coloring and Asymmetric Coloring Games, Manuscript, 2002.Google Scholar
- 9.Kierstead, H. A. and Trotter, W. T.: Competitive colorings of oriented graphs. In honor of Aviezri Fraenkel on the occasion of his 70th üirthday, Electron. J. Comüin. 8 (2001), Research Paper 12, 15 pp. (electronic).Google Scholar
- 10.Kierstead, H. A. and Tuza, Zs.: Marking games and the oriented game chromatic numüer of partial k-trees, Graphs and Comüinatorics (2003), 121–129.Google Scholar
- 12.Nešetřil, J. and Sopena, E.: On the oriented game chromatic numüer. In honor of Aviezri Fraenkel on the occasion of his 70th üirthday, Electron. J. Comüin. 8 (2001), Research Paper 14, 13 pp. (electronic).Google Scholar