Eulerian path facts for kids
Eulerian path is a notion from graph theory. A eulerian path in a graph is one that visits each edge of the graph once only. A Eulerian circuit or Eulerian cycle is an Eulerian path which starts and ends on the same vertex.
All content from Kiddle encyclopedia articles (including the article images and facts) can be freely used under Attribution-ShareAlike license, unless stated otherwise. Cite this article:
Eulerian path Facts for Kids. Kiddle Encyclopedia.