How to Contract a Vertex Transitive 5-Connected Graph

被引：0

作者：

Qin, Chengfu ^{[1
]}

Yang, Weihua ^{[2
]}

Guo, Xiaofeng ^{[3
]}

机构：

[1] Nanning Normal Univ, Sch Math Sci, Nanning 530001, Peoples R China

[2] Taiyuan Univ Technol, Dept Math, Taiyuan 030024, Shanxi, Peoples R China

[3] Xiamen Univ, Sch Math Sci, Xiamen 310065, Peoples R China

来源：

DISCRETE DYNAMICS IN NATURE AND SOCIETY | 2020年 / 2020卷

关键词：

D O I：

10.1155/2020/9315494

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

M.Kriesell conjectured that there existed b, h such that every 5-connected graph G with at least b vertices can be contracted to a 5connected graph G(0) such that 0 < vertical bar V(G)vertical bar - (V(G(0))) < h. We show that this conjecture holds for vertex transitive 5-connected graphs.

引用

页数：10

共 50 条

[1] How to contract an essentially 6-connected graph to a 5-connected graph
Kriesell, Matthias
DISCRETE MATHEMATICS, 2007, 307 (3-5) : 494 - 510
[2] Removable edges in a 5-connected graph and a construction method of 5-connected graphs
Xu, Liqiong
Guo, Xiaofeng
DISCRETE MATHEMATICS, 2008, 308 (09) : 1726 - 1731
[3] Removable Edges in a 5-Connected Graph
Li Qiong XU Xiao Feng GUO School of SciencesJimei UniversityFujian PRChinaSchool of Mathematics SciencesXiamen UniversityFujian PRChina
数学研究与评论, 2011, 31 (04) : 617 - 626
[4] Removable Edges in a 5-Connected Graph
Li Qiong XU 1
2.School of Mathematics Sciences
Journal of Mathematical Research with Applications, 2011, (04) : 617 - 626
[5] Vertices of Degree 5 in a Contraction Critically 5-connected Graph
Kiyoshi Ando
Atsushi Kaneko
Ken-ichi Kawarabayashi
Graphs and Combinatorics, 2005, 21 : 27 - 37
[6] Vertices of degree 5 in a contraction critically 5-connected graph
Ando, K
Kaneko, A
Kawarabayashi, K
GRAPHS AND COMBINATORICS, 2005, 21 (01) : 27 - 37
[7] THE LEAST CONNECTED NON-VERTEX-TRANSITIVE GRAPH WITH CONSTANT NEIGHBORHOODS
ZELINKA, B
CZECHOSLOVAK MATHEMATICAL JOURNAL, 1990, 40 (04) : 619 - 624
[8] Trivially noncontractible edges in a contraction critically 5-connected graph
Ando, K
DISCRETE MATHEMATICS, 2005, 293 (1-3) : 61 - 72
[9] The number of vertices of degree 5 in a contraction-critically 5-connected graph
Ando, Kiyoshi
Iwase, Takashi
DISCRETE MATHEMATICS, 2011, 311 (17) : 1925 - 1939
[10] Cycles in 5-connected triangulations
Alahmadi, A.
Aldred, R. E. L.
Thomassen, C.
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2020, 140 : 27 - 44

← 1 2 3 4 5 →