Eulerian path

== English == === Noun === Eulerian path (plural Eulerian paths) (graph theory) A walk that uses every edge of a graph exactly once.