Title of article
Vertices of degree 6 in a contraction critically 6-connected graph Original Research Article
Author/Authors
Kiyoshi Ando، نويسنده , , Atsushi Kaneko، نويسنده , , Ken-ichi Kawarabayashi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
15
From page
55
To page
69
Abstract
An edge of a 6-connected graph is said to be 6-contractible if the contraction of the edge results in a 6-connected graph. A contraction critically 6-connected graph is a 6-connected graph with no 6-contractible edge. We prove that each contraction critically 6-connected graph G has at least 17|V(G)| vertices of degree 6.
Keywords
6-connected graph , Contractible edge , Contraction critically 6-connected
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
948686
Link To Document