Characteristics of Eulerian Graph

Theorem
A finite (undirected) graph is Eulerian if and only if it is connected and each vertex is even.

Note that the definition of graph here includes:
 * Simple graph
 * Loop-graph
 * Multigraph
 * Loop-multigraph

but does not include directed graph.