A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Efficient computation of the oriented chromatic number of recursively defined digraphs
[article]

2021
*
arXiv
*
pre-print

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 partition of the vertex set V into r independent sets, such that all the arcs between two of these sets have the same direction. The oriented chromatic number of G is the smallest integer r such that G permits an oriented r-coloring. In this paper we consider the Oriented Chromatic Number problem on classes of recursively defined

arXiv:2012.13764v2
fatcat:gh3myesexbdz3kwdi6gwdsco6y