A nontrivial connected graph is Eulerian if and only if every vertex has even degree.

A connected graph has an Euler trail if and only if it has at most 2 vertices of odd degree.

A nontrivial connected graph is Eulerian if and only if every vertex has even degree.

A connected graph has an Euler trail if and only if it has at most 2 vertices of odd degree.