Prove that these 3 statements are equivalence for a connected graph:
a. degree of all vertices are even
b. graph has a closed Euler path (An Euler circuit that can contain repeated vertices)
c. You can part graph edges into separate circuits in a way that each edge is in exactly 1 circuit.
Any hints how to prove?