Title of article
On the Number of Cycles in 3-Connected Cubic Graphs
Author/Authors
Aldred، نويسنده , , R.E.L and Thomassen، نويسنده , , Carsten، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
6
From page
79
To page
84
Abstract
Letf(n) be the minimum number of cycles present in a 3-connected cubic graph onnvertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer.53, 1986) showed thatf(n) is subexponential and conjectured thatf(n) is super-polynomial. We verify this by showing that, fornsufficiently large, 2n0.17<f(n) 2n0.95.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series B
Record number
1526289
Link To Document