Show that a finite graph with all vertices with degree $\geq 2$ has a cycle that contains a vertex which is non-adjacent to any other vertices not contained in the cycle.
I know how to prove that the graph has at least a cycle: just start somewhere and follow the path. If you ever have an option to go back to a vertex you have visited, you have found a cycle. You can never get stuck as each vertex you come to has an exit. Eventually you will run out of vertices.
However, how would i find this special cycle? i tried contradiction, suppose the cycle does not have any such vertex. Then all vertices in the cycle must connect to at least one other vertex not in the cycle. how would i find a contradiction?