Few Hamiltonian cycles in graphs with one or two vertex degrees

DOI10.1090/MCOM/3943MaRDI QIDQ6590640

Jorik Jooken, Carol T. Zamfirescu, On-Hei S. Lo, Ben Seamone, Jan Goedgebeur

Publication date: 21 August 2024

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycleregular graphLovász local lemma

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spanning cycles of nearly cubic graphs
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Chords of longest cycles in cubic graphs
• Long cycles in Hamiltonian graphs
• House of graphs 2.0: a database of interesting graphs and more
• Practical graph isomorphism. II.
• 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
• Fast generation of regular graphs and construction of cages
• On the Minimum Number of Hamiltonian Cycles in Regular Graphs
• Regular Graphs with Few Longest Cycles
• Graphs with few hamiltonian cycles

This page was built for publication: Few Hamiltonian cycles in graphs with one or two vertex degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6590640)