On the number of cycles in 3-connected cubic graphs

被引：12

作者：

Aldred, REL ^{[1
]}

Thomassen, C ^{[1
]}

机构：

[1] TECH UNIV DENMARK,INST MATH,DK-2800 LYNGBY,DENMARK

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1997年 / 71卷 / 01期

关键词：

D O I：

10.1006/jctb.1997.1771

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let f(n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f(n) is subexponential and conjectured that f(n) is superpolynomial. We verify this by showing that, for n sufficiently large, 2(n0.17) < f(n) 2(n0.95). (C) 1997 Academic Press.

引用

页码：79 / 84

页数：6

共 50 条

[21] Contractible Edges in 3-Connected Cubic Graphs
Kou, Shuai
Qin, Chengfu
Yang, Weihua
PARALLEL PROCESSING LETTERS, 2021, 31 (03)
[22] NONREMOVABLE EDGES IN 3-CONNECTED CUBIC GRAPHS
FOUQUET, JL
THUILLIER, H
GRAPHS AND COMBINATORICS, 1991, 7 (02) : 119 - 141
[23] A note on 3-connected cubic planar graphs
Lu, Xiaoyun
DISCRETE MATHEMATICS, 2010, 310 (13-14) : 2054 - 2058
[24] Nonhamiltonian 3-connected cubic planar graphs
Aldred, REL
Bau, S
Holton, DA
McKay, BD
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2000, 13 (01) : 25 - 32
[25] On removable edges in 3-connected cubic graphs
Fouquet, Jean-Luc
Thuillier, Henri
DISCRETE MATHEMATICS, 2012, 312 (17) : 2652 - 2659
[26] Cuts in matchings of 3-connected cubic graphs
Knauer, Koija
Valicov, Petru
EUROPEAN JOURNAL OF COMBINATORICS, 2019, 76 : 27 - 36
[27] LONGEST CYCLES IN 3-CONNECTED PLANAR GRAPHS
JACKSON, B
WORMALD, NC
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1992, 54 (02) : 291 - 321
[28] DOMINATING CYCLES IN REGULAR 3-CONNECTED GRAPHS
JACKSON, B
LI, H
ZHU, YJ
DISCRETE MATHEMATICS, 1992, 102 (02) : 163 - 176
[29] ON THE LONGEST CYCLES IN A CLASS OF 3-CONNECTED GRAPHS
CHEN, CP
ZHU, YJ
ANNALS OF THE NEW YORK ACADEMY OF SCIENCES, 1989, 576 : 107 - 117
[30] HAMILTON CYCLES IN REGULAR 3-CONNECTED GRAPHS
ZHU, YJ
LI, H
DISCRETE MATHEMATICS, 1992, 110 (1-3) : 229 - 249

← 1 2 3 4 5 →