We consider the notion of perfection in the coloring of oriented graphs. Perfect graphs are very important in the field of algorithms, as many problems that are NP-complete in general can be solved in polynomial time in perfect graphs. Our interest is to define an analog of perfection for oriented coloring and determine which oriented graphs are perfect. As such, our focus is on what we call ocliques -- analogous to cliques in undirected graphs. We describe programs to compute the oriented chromatic number and oclique size for oriented graphs, and survey some basic results
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.