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.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: January 12, 2001 Final version received: February 25, 2002
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s00373-002-0489-5