Efficient computation of the oriented chromatic number of recursively defined digraphs

Frank Gurski, Dominique Komander, Marvin Lindemann

In this paper we consider colorings of oriented graphs, i.e. digraphs without cycles of length 2. Given some oriented graph $G=(V,E)$, an oriented $r$-coloring for $G$ is a partiti…