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 条

[1] LONGEST CYCLES IN 3-CONNECTED CUBIC GRAPHS
JACKSON, B
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 41 (01) : 17 - 26
[2] CYCLES CONTAINING 12 VERTICES IN 3-CONNECTED CUBIC GRAPHS
BAU, S
HOLTON, D
JOURNAL OF GRAPH THEORY, 1991, 15 (04) : 421 - 429
[3] CYCLES THROUGH 10 VERTICES IN 3-CONNECTED CUBIC GRAPHS
ELLINGHAM, MN
HOLTON, DA
LITTLE, CHC
COMBINATORICA, 1984, 4 (04) : 265 - 273
[4] HAMILTONIAN CYCLES IN CUBIC 3-CONNECTED BIPARTITE PLANAR GRAPHS
HOLTON, DA
MANVEL, B
MCKAY, BD
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (03) : 279 - 297
[5] CYCLES THROUGH 5 EDGES IN 3-CONNECTED CUBIC GRAPHS
ALDRED, REL
HOLTON, DA
GRAPHS AND COMBINATORICS, 1987, 3 (04) : 299 - 311
[6] CYCLES THROUGH 4 EDGES IN 3-CONNECTED CUBIC GRAPHS
ALDRED, REL
HOLTON, DA
THOMASSEN, C
GRAPHS AND COMBINATORICS, 1985, 1 (01) : 7 - 11
[7] On Cycles in 3-Connected Graphs
Hao Li
Graphs and Combinatorics, 2000, 16 : 319 - 335
[8] On cycles in 3-connected graphs
Li, H
GRAPHS AND COMBINATORICS, 2000, 16 (03) : 319 - 335
[9] Longest Cycles in 3-connected Graphs with Given Independence Number
Manoussakis, Y.
GRAPHS AND COMBINATORICS, 2009, 25 (03) : 377 - 384
[10] Longest Cycles in 3-connected Graphs with Given Independence Number
Y. Manoussakis
Graphs and Combinatorics, 2009, 25 : 377 - 384

← 1 2 3 4 5 →