Definition:Eulerian Path

From ProofWiki
Jump to: navigation, search

Definition

An Eulerian path is a path $P$ that passes through every vertex of a graph $G$ and uses every edge of $G$ exactly once.


Such a path is said to traverse $G$.


Also see


Source of Name

This entry was named for Leonhard Paul Euler.

Personal tools
Namespaces
Variants
Actions
Navigation
ProofWiki.org
ToDo
Toolbox
Google AdSense