On the maximum number of cycles in a Hamiltonian graph

DOI10.1016/j.disc.2005.09.007zbMath1081.05064OpenAlexW1968656937MaRDI QIDQ2576841

Irene Stella, Dieter Rautenbach

Publication date: 29 December 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.007

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

On graphs with many cycles ⋮ Triangle-free graphs with the maximum number of cycles ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Cycle-maximal triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The number of cycles in a Hamilton graph
• Estimations for the number of cycles in a graph

This page was built for publication: On the maximum number of cycles in a Hamiltonian graph