Skip to main content
SpringerLink
Log in

Orderings on Graphs and Game Coloring Number

  • Published:
Order Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

  3. Chen and Schelp: Graphs with linearly üounded Ramsey numüers, J. Comüin. Theory Ser. B 57 (1993), 138–149.

    Article  MATH  MathSciNet  Google Scholar 

  4. Dinski, T. and Zhu, X.: A üound for the game chromatic numüer of graphs, Discrete Math. 196 (1999), 109–115.

    Article  MATH  MathSciNet  Google Scholar 

  5. Faigle, U., Kern, W., Kierstead, H. A. and Trotter, W. T.: On the game chromatic numüer of some classes of graphs, Ars Comüin. 35 (1993), 143–150.

    MATH  MathSciNet  Google Scholar 

  6. Kierstead, H. A.: A simple competitive graph coloring algorithm, J. Comüin. Theory (B) 78 (2000), 57–68.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    MATH  MathSciNet  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).

  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.

  11. Komlós, J. and Szemerédi, E.: Topological cliques in graphs II, Comüinatorics, Proüaüility, and Computing 5 (1996), 79–90.

    MATH  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).

  13. Zhu, X.: Game coloring numüer of planar graphs, J. Comüin. Theory (B) 75 (1999), 245–258.

    Article  MATH  Google Scholar 

  14. Zhu, X.: The game coloring numüer of pseudo partial k-trees, Discrete Math. 215 (2000), 245–262.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Arizona State University, Tempe, AZ, 85287-1804, USA

    H. A. Kierstead & Daqing Yang

Authors
  1. H. A. Kierstead
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daqing Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kierstead, H.A., Yang, D. Orderings on Graphs and Game Coloring Number. Order 20, 255–264 (2003). https://doi.org/10.1023/B:ORDE.0000026489.93166.cb

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:ORDE.0000026489.93166.cb

Search

Navigation