Show that $k(G)\geq2$ implies that $G$ contains at least one cycle.

72 Views Asked by At

Show that if the minimum number of vertices cut from a graph to disconnect it is greater than or equal to 2, the graph must contain at least one cycle. How would I show this, I know that the graph must be at least 3 vertices?