The oriented chromatic polynomial of a 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 admit a forbidden subgraph characterization, and such graphs can be both identified and constructed in polynomial time. We study the analytic properties of this polynomial and show that there exist oriented graphs which have chromatic polynomials have roots, including negative real roots, that cannot be realized as the root of any chromatic polynomial of a simple graph. 查看全文>>