Jump to content

Eulerian path

From Wiktionary, the free dictionary

English

[edit]

Noun

[edit]

Eulerian path (plural Eulerian paths)

  1. (graph theory) A walk that uses every edge of a graph exactly once.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Eulerian_path&oldid=82613710"