Euler circuits and paths
7.5
An Euler circuit in a graph G is a simple circuit containing every edge
of G.
An Euler path in G is a simple path containing every edge of G.
Examples.
Has a circuit
Has a path,
no circuit
No path
Has a path,
no circuit
Previous slide
Next slide
Back to first slide
View graphic version