We've updated our
Privacy Policy effective December 15. Please read our updated Privacy Policy and tap


Study Guides > Mathematics for the Liberal Arts Corequisite

Introduction to Euler and Hamiltonian Paths and Circuits

What you’ll learn to do: Find Euler and Hamiltonian paths and circuits within a defined graph

In the next lesson, we will investigate specific kinds of paths through a graph called Euler paths and circuits. Euler paths are an optimal path through a graph. They are named after him because it was Euler who first defined them. By counting the number of vertices of a graph, and their degree we can determine whether a graph has an Euler path or circuit. We will also learn another algorithm that will allow us to find an Euler circuit once we determine that a graph has one.

Licenses & Attributions

CC licensed content, Original

  • Learning Outcomes and Introduction. Provided by: Lumen Learning License: CC BY: Attribution.