Skip to main content
SpringerLink
Log in

Marking Games and the Oriented Game Chromatic Number of Partial k-Trees

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 Nešetřil and Sopena introduced the concept of oriented game chromatic number. They asked whether the oriented game chromatic number of partial k-trees was bounded. Here we answer their question positively.

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

Author information

Authors and Affiliations

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

    H.A. Kierstead

  2. Computer and Automation Institute, Hungarian Academy of Sciences; and Department of Computer Science, University of Veszprém, Hungary, , , , , , HU

    Zs. Tuza

Authors
  1. H.A. Kierstead
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zs. Tuza
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: January 12, 2001 Final version received: February 25, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kierstead, H., Tuza, Z. Marking Games and the Oriented Game Chromatic Number of Partial k-Trees. Graphs and Combinatorics 19, 121–129 (2003). https://doi.org/10.1007/s00373-002-0489-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0489-5

Keywords

Search

Navigation