Back to Discrete Mathematics: An Open Introduction
Euler Paths and Circuits
A degree-based test for when a graph can be traced in one continuous stroke without retracing an edge.
Discrete Mathematics: An Open Introduction, Euler Paths and Circuits
StatusFlagsLoading your progress…
Adapted from Discrete Mathematics: An Open Introduction © 2013–2019 Oscar Levin. Licensed under CC BY-SA 4.0. Source: Discrete Mathematics: An Open Introduction. Imported at revision 1e2e26b.