Maximum number of contractible edges on longest cycles of a 3-connected graph

被引：0

作者：

Fujita, K ^{[1
]}

机构：

[1] Toyo Univ, Dept Life Sci, Itakura, Gunma 3740193, Japan

来源：

ARS COMBINATORIA | 2005年 / 74卷

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that if G is a 3-connected graph of order at least, 5, then there exists a longest, cycle C of G such that the number of contractible edges of G which axe on C is greater than or equal to (vertical bar V(C)vertical bar+9)/(8).

引用

页码：129 / 149

页数：21

共 50 条

[1] Maximum Number of Contractible Edges on Hamiltonian Cycles of a 3-Connected Graph
Kyo Fujita
[J]. Graphs and Combinatorics, 2002, 18 : 447 - 478
[2] Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
Fujita, K
[J]. GRAPHS AND COMBINATORICS, 2002, 18 (03) : 447 - 478
[3] Contractible Edges and Longest Cycles in 3-Connected Graphs
Egawa, Yoshimi
Nakamura, Shunsuke
[J]. GRAPHS AND COMBINATORICS, 2023, 39 (01)
[4] Contractible Edges and Longest Cycles in 3-Connected Graphs
Yoshimi Egawa
Shunsuke Nakamura
[J]. Graphs and Combinatorics, 2023, 39
[5] LONGEST CYCLES IN 3-CONNECTED GRAPHS CONTAIN 3 CONTRACTIBLE EDGES
DEAN, N
HEMMINGER, RL
OTA, K
[J]. JOURNAL OF GRAPH THEORY, 1989, 13 (01) : 17 - 21
[6] Contractible Edges and Contractible Triangles in a 3-Connected Graph
Ando, Kiyoshi
Egawa, Yoshimi
[J]. GRAPHS AND COMBINATORICS, 2021, 37 (05) : 1807 - 1821
[7] Contractible Edges and Contractible Triangles in a 3-Connected Graph
Kiyoshi Ando
Yoshimi Egawa
[J]. Graphs and Combinatorics, 2021, 37 : 1807 - 1821
[8] THE NUMBER OF CONTRACTIBLE EDGES IN 3-CONNECTED GRAPHS
OTA, K
[J]. GRAPHS AND COMBINATORICS, 1988, 4 (04) : 333 - 354
[9] Properly 3-contractible edges in a minimally 3-connected graph
Ando, Kiyoshi
Egawa, Yoshimi
[J]. DISCRETE MATHEMATICS, 2023, 346 (05)
[10] Removable Edges and Chords of Longest Cycles in 3-Connected Graphs
Jichang Wu
Hajo Broersma
Haiyan Kang
[J]. Graphs and Combinatorics, 2014, 30 : 743 - 753

← 1 2 3 4 5 →