I need help with the following exercises
Let G be a connected graph that is not a path. Prove that it has at least
three vertices such that if any of them is removed, the remaining graph is still
connected.
Draw all graphs on 5 nodes in which every node has degree at most 2.
I would appreciate any help.