An Euler Cycle is a path in a graph (see graph theory) that visits every vertex exactly once.

Compare with Hamilton cycle.

We have a condition to test if a graph is Eulerian. If every vertex has even degree, then every component has an Euler Cycle.

CategoryTheory
Euler
FourColourTheorem
MathematicsTaxonomy
ThreeUtilitiesProblem
(none) (none)
GraphTheory (none)

## You are here

EulerCycle
Euler
HamiltonCycle
FourColourTheorem (none) Calculus
FamousPeople
NPComplete
Polynomial