On an interpolation property of outerplanar graphs (Q2581566)

Let \(D\) be an acyclic orientation of a graph \(G\). An arc of \(D\) is dependent if a directed cycle is created when it is reversed. Denote by \(d(D)\) the number of dependent arcs in \(D\). Let \(d_{\min}(G)\) be the minimum \(d(D)\), and \(d_{\max}(G)\) the maximum \(d(D)\), over all acyclic orientations \(D\) of \(G\). The authors measure \(d_{\min}(G)\) in terms of edge coverings of the weak dual of \(G\). They show \(G\) has an acyclic orientation with \(k\) dependent arcs if \(d_{\min}(G) \leq k \leq d_{\max}(G)\).