Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs

It is proved that if G is a k-connected graph which does not contain K4−, then G has an induced cycle C such that G – V(C) is (k − 2)-connected and either every edge of C is k-contractible or C is a triangle. This theorem is a generalization of some known theorems.