A connected graph in which every vertex is of even degree.
Figure 1 shows an example of an Eulerian graph.
Figure 1: an Eulerian graph with 7 vertices.
A property of Eulerian graphs is that they can be completly traversed without following any edge more than once.
This Eulerian cycle means that you can move along every edge on the graph returning to your start point without ever covering the same ground twice.