Page "Eulerian path" Paragraph 1
from
Wikipedia
Every vertex of this graph has an even degree, therefore this is an Eulerian graph.
Following the edges in alphabetical order gives an Eulerian circuit / cycle.
Page 1 of 1.
1.931 seconds.