Mathematics — Probability · directed-graphs-euler-circuit
Problem
A digraph has an Euler circuit if there is a closed walk that uses every arc exactly once. Show that a digraph with no vertices of degree 0 has an Euler circuit if and only if it is connected and d+(v)=d−(v) for all vertices v.