Euler path | Euler walk | Eulerian trail | Eulerian walk

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each graph edge in the original graph exactly once. A connected graph has an Eulerian path iff it has at most two graph vertices of odd degree.

Eulerian cycle | Eulerian graph | Hamiltonian cycle | Hamiltonian path | Königsberg bridge problem | path | walk