A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Suppose that D is an acyclic orientation of a graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d min (G) (d max (G)) denote the minimum (maximum) of the number of dependent arcs over all acyclic orientations of G. We call G fully orientable if G has an acyclic orientation with exactly d dependent arcs for every d satisfying d min (G) d d max (G). We show that a connected graph G is fully orientable if d min (G) 1. This generalizes the main result in Fisher et al.doi:10.1016/j.dam.2009.04.013 fatcat:laypq2jbqfbcvgqw3rdopobouu