A graph is an Eulerian Graph if it contains a Euler Circuit. A connected graph is Eulerian Graph iff the degree of each vertex is an even number. An oriented graph is Eulerian iff for all vertices and the undirected graph it is derived from has only one component.
