A graph is Eulerian if and only if:
It is connected and all vertices have even degree.
It has exactly two vertices of odd degree.
It has no cycles of odd length.
It is a tree.