Title of article
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs
Author/Authors
Egawa، نويسنده , , Yoshimi and Inoue، نويسنده , , Katsumi and Kawarabayashi، نويسنده , , Ken-ichi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
12
From page
253
To page
264
Abstract
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.
Keywords
Nonseparating cycle , contractible edge , k-connected graphs
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2002
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453294
Link To Document