On the Oriented Game Chromatic Number
We consider the oriented version of a coloring game introduced by Bodlaender [On the complexity of some coloring games, Internat. J. Found. Comput. Sci. 2 (1991), 133–147]. We prove that every oriented path has oriented game chromatic number at most 7 (and this bound is tight), that every oriented tree has oriented game chromatic number at most 19 and that there exists a constant $t$ such that every oriented outerplanar graph has oriented game chromatic number at most $t$.
Keyword(s):
2004 ◽
Vol 281
(1-3)
◽
pp. 209-219
◽
2019 ◽
Vol 795
◽
pp. 50-56
◽
2008 ◽
Vol 32
(2)
◽
pp. 223-235
◽
2009 ◽
Vol 309
(11)
◽
pp. 3564-3579
◽
2019 ◽
Vol 09
(04)
◽
pp. 159-164
◽
2007 ◽
Vol 102
(4)
◽
pp. 147-151
◽
2016 ◽
Vol 100
(7)
◽
pp. 1041-1054
2019 ◽
Vol 13
(S1)
◽
pp. 261-265