On the number of cycles in 3-connected cubic graphs

DOI10.1006/jctb.1997.1771zbMath0918.05068OpenAlexW1973765733MaRDI QIDQ1386478

R. E. L. Aldred, Carsten Thomassen

Publication date: 10 August 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1771

zbMATH Keywords

cubic graphnumber of cycles

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items

Regular Graphs with Few Longest Cycles ⋮ Proof of Komlós's conjecture on Hamiltonian subsets ⋮ Triangle-free graphs with the maximum number of cycles ⋮ Cycles in 5-connected triangulations ⋮ The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes] ⋮ A family of efficient six-regular circulants representable as a Kronecker product

Cites Work

• Longest cycles in 3-connected cubic graphs
• Longest Cycles in 3-Connected 3-Regular Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item