Eulerian trail

== English == === Noun === Eulerian trail (plural Eulerian trails) (graph theory) A trail that contains each edge exactly once. ==== Hyponyms ==== Eulerian circuit ==== Translations ==== === References === Weisstein, Eric W. "Eulerian Path." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/EulerianPath.html