9 citations · 13 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
Acyclic coloring of special digraphs
Frank Gurski, Dominique Komander, Carolin Rehs
An acyclic r-coloring of a directed graph G=(V,E) is a partition of the vertex set V into r acyclic sets. The dichromatic number of a directed graph G is the smallest r such that G…
Oriented coloring on recursively defined digraphs
Frank Gurski, Dominique Komander, Carolin Rehs
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring proble…