Prove that every undirected connected graph with $|V | > 2$ results in a connected graph if two vertices removed..
Hint: Find the connected graph's spanning tree (using an algorithm like breadth-first search). Consider the endpoints of a longest path in this spanning tree.