Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs

DOI10.1016/j.dam.2024.05.021zbMATH Open1544.05051MaRDI QIDQ6585253

Jorik Jooken

Publication date: 9 August 2024

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

zbMATH Keywords

Hamiltonian cycleregular graphlongest cycle

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
• Spanning cycles of nearly cubic graphs
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Long cycles in Hamiltonian graphs
• House of graphs 2.0: a database of interesting graphs and more
• On uniquely Hamiltonian claw-free and triangle-free graphs
• Uniquely Hamiltonian Graphs of Minimum Degree 4
• A Dynamic Programming Approach to Sequencing Problems
• Independent dominating sets and hamiltonian cycles
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• On the Minimum Number of Hamiltonian Cycles in Regular Graphs
• 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles
• Regular Graphs with Few Longest Cycles
• Graphs with few hamiltonian cycles
• The Generation of Fullerenes
• Regular Graphs with Given Girth and Restricted Circuits
• On Hamiltonian Circuits

This page was built for publication: Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs