On the oriented game chromatic number (Q5942568)

The oriented graph coloring game can be seen as the game version of the oriented chromatic number of a graph. In this game, an oriented graph \(G\) and an oriented graph \(H\) are given. Players alternatingly color an uncolored vertex of \(G\) with a vertex of \(H\), such that for every arc \((v,w)\), if \(v\) is colored \(\alpha\), and \(w\) is colored \(\beta\), then \((\alpha,\beta)\) is an arc in \(H\), and every directed path of length two has its endpoints differently colored. The first player wins if the game ends with \(G\) colored; the second player wins when there are vertices that cannot be colored. The oriented game chromatic number of \(G\) is the minimum size of a graph \(H\) such that there is a winning strategy for the first player. In this paper, it is proved that the notion is well defined, that every oriented path or oriented cycle has oriented game chromatic number at most 7, which is a tight bound, that every oriented tree has oriented game chromatic number at most 19, and that outerplanar graphs have oriented game chromatic number bounded by some fixed constant.