On uniquely Hamiltonian claw-free and triangle-free graphs

DOI10.7151/dmgt.1784zbMath1311.05104OpenAlexW2033296948MaRDI QIDQ2344006

Ben Seamone

Publication date: 11 May 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1784

zbMATH Keywords

Hamiltonian cycletriangle-free graphsclaw-free graphsuniquely Hamiltonian graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Graphs with few hamiltonian cycles

Cites Work

• Unnamed Item
• Chromatic properties of Hamiltonian graphs
• A degree constraint for uniquely Hamiltonian graphs
• Spanning cycles of nearly cubic graphs
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Vertices of small degree in uniquely Hamiltonian graphs
• On the Number of Hamiltonian Cycles in Bipartite Graphs
• Uniquely Hamiltonian Graphs of Minimum Degree 4
• Independent dominating sets and hamiltonian cycles
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• On Hamiltonian Circuits

This page was built for publication: On uniquely Hamiltonian claw-free and triangle-free graphs