A connected graph is Eulerian if and only if:
All vertices have even degree and it has a cycle
It has exactly two vertices of odd degree
All vertices have even degree and it is connected
It is a tree