"An Eulerian tour is a walk that goes over every edge exactly once. If G is a graph on n vertices such that degree of each vertex is even then prove that G has an Eulerian tour."
I'm thinking since the degree of each vertex is even, then there will be a cycle in the graph. I don't know how much this helps though, because I don't know how to prove that there is a cycle that goes through every edge exactly once.
Thanks for any help!