An acyclic orientation of an undirected graph is a graph orientation that has no directed cycles, so the resulting directed graph is an acyclic digraph (Stanley 1973).
For a finite graph 
with 
vertices and chromatic
polynomial 
,
the number of acyclic orientations is 
(Stanley 1973).
