4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles

zbMath1490.05149arXiv2104.06347MaRDI QIDQ5026982

Carol T. Zamfirescu, Carsten Thomassen

Publication date: 8 February 2022

Full work available at URL: https://arxiv.org/abs/2104.06347

zbMATH Keywords

Hamiltonian cycles4-regular graphs3-regular graphs

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Regular Graphs with Few Longest Cycles ⋮ From one to many rainbow Hamiltonian cycles

Uses Software

• GenerateUHG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• 4-connected polyhedra have at least a linear number of Hamiltonian cycles
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• On the Number of Hamiltonian Cycles in Bipartite Graphs
• Independent dominating sets and hamiltonian cycles
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• On the Minimum Number of Hamiltonian Cycles in Regular Graphs
• Graphs with few hamiltonian cycles
• Polytopes, graphs, and complexes
• On Hamiltonian Circuits

This page was built for publication: 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles