2 papers
cs.DS2022
Efficient computation of oriented vertex and arc colorings of special digraphs
Frank Gurski, Dominique Komander, Marvin Lindemann
In this paper we study the oriented vertex and arc coloring problem on edge series-parallel digraphs (esp-digraphs) which are related to the well known series-parallel graphs. Seri…
math.CO2020
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 , an oriented -coloring for is a partiti…