60. Suppose that for a certain connected graph, it is possible to disconnect it by removing one edge. Explain why such a graph (before the edge is removed) must have at least one vertex of odd valence. (Hint: Show that it cannot have an Euler circuit.)