Chromatic polynomials of oriented graphs (Q2325756)

Summary: The oriented chromatic polynomial of an oriented graph outputs the number of oriented \(k\)-colourings for any input \(k\). We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying simple graph, closing an open problem posed by Sopena. We find that such oriented graphs can be both identified and constructed in polynomial time as they are exactly the family of quasi-transitive oriented co-interval graphs. We study the analytic properties of this polynomial and show that there exist oriented graphs which have chromatic polynomials with roots, including negative real roots, that cannot be realized as the root of any chromatic polynomial of a simple graph.