Chapter 5.2, Problem 32ES

Route Planning A city engineer needs to inspect the traffic signs at each street intersection of a neighborhood. The engineer has drawn a graph to represent the neighborhood, where the edges represent the streets and the vertices correspond to street intersections. Would the most efficient route to drive correspond to an Euler circuit, a Hamiltonian circuit, or neither? (The engineer must return to the starting location when finished.) Explain your answer.