Chartrand's theorem: connectivity, edge connectivity and minimum degree coincide for cubic graphs

Let $k,k'$ and $\delta$ be the vertex connectivity, edge connectivity and minimum degree respectively of graph G. Then: