New posts in Graph Connectivity

Prove that connected graph $G$ with $\delta (G)\geq 3$ contains a cycle $C$ such that $G-E(C)$ is still connected.

Prove a graph is cyclic