In an Eulerian graph, there exists a walk that traverses every edge in the graph exactly once. Such a walk is called an Eulerian tour or cycle.
In an Eulerian graph, there exists a walk that traverses every edge in the graph exactly once. Such a walk is called an Eulerian tour or cycle.