Marking games and the oriented game chromatic number of partial k-trees

H. A. Kierstead, Zs Tuza

Research output: Contribution to journalArticle

25 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)121-129
Number of pages9
JournalGraphs and Combinatorics
Volume19
Issue number1
DOIs
Publication statusPublished - Jul 1 2003

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Marking games and the oriented game chromatic number of partial k-trees'. Together they form a unique fingerprint.

  • Cite this