Some inequalities for orderings of acyclic digraphs

Thomas Bier, Imed Zaguia

Let $D=(V,A)$ be an acyclic digraph. For $x\in V$ define $e_{{}_D}(x)$ to be the difference of the indegree and the outdegree of $x$. An acyclic ordering of the vertices of $D$ is…