A nontrivial connected graph is Eulerian if and only if every vertex has even degree.
Proof: Graph is Eulerian iff All Vertices have Even Degree | Euler Circuits, Graph Theory
Wrath of Math
A connected graph has an Euler trail if and only if it has at most 2 vertices of odd degree.