If a graph has an Euler circuit, which of the following must be true?
All vertices have odd degree.
The number of vertices is even.
All vertices have even degree.
It is a tree.