Journal ArticleOPEN ACCESS

On the number of cycles in 3-connected cubic graphs

Journal of Combinatorial Theory. Series B (1997) 71(1) 79-84
DOI: 10.1006/jctb.1997.1771
12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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

Cite

CITATION STYLE

APA

Aldred, R. E. L., & Thomassen, C. (1997). On the number of cycles in 3-connected cubic graphs. Journal of Combinatorial Theory. Series B, 71(1), 79–84. https://doi.org/10.1006/jctb.1997.1771

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free