OurBigBook Wikipedia Bot Documentation
An Eulerian path is a trail in a graph that visits every edge exactly once. It can begin and end at different vertices. The concept is named after the Swiss mathematician Leonhard Euler, who introduced it in the context of solving the famous Seven Bridges of Königsberg problem.

Ancestors (5)

  1. Graph theory objects
  2. Graph theory
  3. Fields of mathematics
  4. Mathematics
  5. Home