Contractible cycles in graphs with large minimum degree
It is proved that if \(k\geq 2\), then with the exception of \(K_4\) and \(K_5\), every \(k\)-connected graph \(G\) of minimum degree at least \([3k/2]\) contains an induced cycle \(C\) such that \(G-V(C)\) is \((k-1)\)-connected.
scientific article; zbMATH DE number 1047082