A walk is called Eulerian if it visits each edge of the graph exactly once.
An Eulerian graph is a graph which contains an Eulerian circuit. A graph is Eulerian if and only if every vertex has an even degree.
In GrInvIn you can verify if a graph is Eulerian by using the Eulerian invariant.