Title of article
Contractible edges in minimally k-connected graphs
Author/Authors
Ando، نويسنده , , Kiyoshi and Kaneko، نويسنده , , Atsushi and Kawarabayashi، نويسنده , , Ken-ichi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
10
From page
20
To page
29
Abstract
An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. In this paper, we prove that a (K1 + C4)-free minimally k-connected graph has a k-contractible edge, if around each vertex of degree k, there is an edge which is not contained in a triangle. This implies previous two results, one due to Thomassen and the other due to Kawarabayashi.
Keywords
contractible edge , k-connected graph , minimally k-connected
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2002
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453266
Link To Document