The Gallai-Hasse-Roy-Vitaver theorem states that a graph has an acyclic orientation in which the longest path has at most vertices if and only if it can be colored with at most colors [REF].
The number of acyclic orientations may be counted using the chromatic polynomial \chi_G, whose value at a positive integer is the number of -colorings of the graph.