Marking Games and the Oriented Game Chromatic Number of Partial <Emphasis Type="Italic">k</Emphasis>-Trees |
| |
| Authors: | HA Kierstead Zs Tuza |
| |
| Institution: | (1) Department of Mathematics, Arizona State University, Tempe, AZ 85287-1804, USA, US;(2) Computer and Automation Institute, Hungarian Academy of Sciences; and Department of Computer Science, University of Veszprém, Hungary, HU |
| |
| 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.
Received: January 12, 2001 Final version received: February 25, 2002 |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
