Balanced digraph

Balanced digraph — сбалансированный орграф.

1. A digraph is balanced, if for every vertex [math]\displaystyle{ v }[/math], [math]\displaystyle{ deg^{+}(v) = deg^{-}(v) }[/math].

2. A directed graph is called balanced if each of its cycles contains equal numbers of forward and backward arcs.

3. A directed graph [math]\displaystyle{ G }[/math] is balanced if there exists a homomorphism of [math]\displaystyle{ G }[/math] to a monotone path.