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 language||English (US)|
|Number of pages||9|
|Journal||Graphs and Combinatorics|
|State||Published - Jul 1 2003|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics