Vertices of degree 6 in a contraction critically 6-connected graph

被引：4
|
作者：
Ando, K
Kaneko, A
Kawarabayashi, K
机构：
[1] Univ Electrocommun, Dept Informat & Commun Engn, Chofu, Tokyo 1828585, Japan
[2] Kogakuin Univ, Dept Comp Sci & Commun Engn, Shinjuku Ku, Tokyo 1638677, Japan
[3] Keio Univ, Fac Sci & Technol, Dept Math, Kohoku Ku, Yokohama, Kanagawa 1638677, Japan
来源：
DISCRETE MATHEMATICS | 2003年 / 273卷 / 1-3期
关键词：
6-connected graph; contractible edge; contraction critically 6-connected;
D O I：
10.1016/S0012-365X(03)00228-0
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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 1/7\V(G)\ vertices of degree 6. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码：55 / 69
页数：15
相关论文
共 50 条
12345