On the number of cycles in 3-connected cubic graphs
type: Item
instance of: scholarly article
title: On the number of cycles in 3-connected cubic graphs
zbMATH Open document ID: 0918.05068
author: R. E. L. Aldred
author: Carsten Thomassen
published in: Journal of Combinatorial Theory. Series B
publication date: 1998-08-10T00:00:00Z
review text: Let \(f(n)\) denote the minimum number of cycles in a 3-connected cubic graph. The authors show that \(f(n)\) is superpolynomial, by showing that for \(n\) sufficiently large, \(2^{n^{0.17}}<f(n)<2^{n^{0.95}}\). This confirms a conjecture by \textit{C. A. Barefoot}, \textit{L. Clark} and \textit{R. Entringer} [Congr. Nummerantium 53, 49-62 (1986; Zbl 0623.05033)].
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1154636
zbMATH Keywords: number of cycles
zbMATH Keywords: cubic graph
reviewed by: Jørgen Bang-Jensen
MaRDI profile type: Publication
full work available at URL: jctb.1997.1771
OpenAlex ID: W1973765733
cites work: Q3760576
cites work: Longest Cycles in 3-Connected 3-Regular Graphs
cites work: Q4871748
cites work: Longest cycles in 3-connected cubic graphs
cites work: Q5759552
DOI: 10.1006/JCTB.1997.1771
description: scientific article; zbMATH DE number 1154636