Which nontrivial connected graphs G have closed spanning walks that contain every edge of G exactly three times?
a) Eulerian graphs
b) Hamiltonian graphs
c) Bipartite graphs
d) Planar graphs