Title of article
Vertices of degree 6 in a 6-contraction critical graph
Author/Authors
Ando، نويسنده , , Kiyoshi and Kaneko، نويسنده , , Atsushi and Kawarabayashi، نويسنده , , Ken-ichi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
5
From page
2
To page
6
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. A k-connected graph with no k-contractible edge is said to be a k-contraction critical graph. We prove that every 6-contraction critical graph of order n, has at least n/7, vertices of degree 6.
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452901
Link To Document