Cycle does not Contain Subcycles
Let $G$ be a cycle graph.
Then there exists some vertex $v$ that is not in $C$.
Let $u$ be any vertex of $C$.
Therefore there is a walk from $u$ to $v$ in $G$.
Thus it has a degree of at least $3$.
The result follows by Proof by Contradiction.