Eulerian pathChemin eulérien
Trail in a graph that visits each edge onceThéorie des graphes
In graph theory, an Eulerian trail is a trail in a finite graph that visits every edge exactly once. Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex.
