Combinatorics and Graph Theory · Problem 5.11.2

Graph Theory — David Guichard

Mathematics — Combinatorics · 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

\mathrm{d}^+(v) = \mathrm{d}^-(v)

for all vertices

v

Related theory

Euler S Totient Function And Euler S Theorem

Browse the problem library