...five vertices having degrees 2, 2, 3, 4, 4, or explain why...
Show that every connected graph has a vertex whose removal (including all adjacent edges) will not disconnect the graph. And design a DFS-based algorithm that finds such a vertex. Let G be an undirected graph,