Oriented Coloring on Recursively Defined Digraphs
Algorithmics for Hard Problems Group, Institute of Computer Science, Heinrich Heine University Düsseldorf, 40225 Düsseldorf, Germany
Author to whom correspondence should be addressed.
Received: 21 February 2019 / Revised: 15 April 2019 / Accepted: 22 April 2019 / Published: 25 April 2019
PDF [332 KB, uploaded 26 April 2019]
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 problems on directed graphs. An oriented k
-coloring of an oriented graph
is a partition of the vertex set V
independent sets such that all the arcs linking two of these subsets have the same direction. The oriented chromatic number of an oriented graph G
is the smallest k
such that G
allows an oriented k
-coloring. Deciding whether an acyclic digraph allows an oriented 4-coloring is NP-hard. It follows that finding the chromatic number of an oriented graph is an NP-hard problem, too. This motivates to consider the problem on oriented co-graphs. After giving several characterizations for this graph class, we show a linear time algorithm which computes an optimal oriented coloring for an oriented co-graph. We further prove how the oriented chromatic number can be computed for the disjoint union and order composition from the oriented chromatic number of the involved oriented co-graphs. It turns out that within oriented co-graphs the oriented chromatic number is equal to the length of a longest oriented path plus one. We also show that the graph isomorphism problem on oriented co-graphs can be solved in linear time.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Gurski, F.; Komander, D.; Rehs, C. Oriented Coloring on Recursively Defined Digraphs. Algorithms 2019, 12, 87.
Gurski F, Komander D, Rehs C. Oriented Coloring on Recursively Defined Digraphs. Algorithms. 2019; 12(4):87.
Gurski, Frank; Komander, Dominique; Rehs, Carolin. 2019. "Oriented Coloring on Recursively Defined Digraphs." Algorithms 12, no. 4: 87.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.