5-Shredders of Contraction-Critical 5-Connected Graphs

被引：0
|
作者：
Qin, Chengfu [1 ]
Yang, Weihua [2 ]
机构：
[1] Nanning Normal Univ, Sch Math & Stat, Nanning 530001, Guangxi, Peoples R China
[2] Taiyuan Univ Technol, Dept Math, Taiyuan 030024, Shanxi, Peoples R China
来源：
PARALLEL PROCESSING LETTERS | 2020年 / 30卷 / 03期
关键词：
Shredders; 5-connected graph; contraction critical;
D O I：
10.1142/S0129626420400083
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Yoshimi Egawa [8] showed that a 5-connected graph G admits at most 2 vertical bar V(G)vertical bar-10/3 5-shredders. In this paper we shown that a contraction-critical 5-connected graph G admits at most vertical bar G vertical bar-6/2 5-shredders. Further we show that, for every contraction-critical 5-connected graph G, there is a contraction critical 5-connected graph (G) over tilde such that G is a spanning subgraph of a and a admits at most vertical bar G vertical bar-1/45-shredders.
引用
收藏
页数：16
相关论文
共 50 条
12345