A degree constraint for uniquely Hamiltonian graphs

DOI10.1007/s00373-006-0666-zzbMath1118.05055OpenAlexW2066542589MaRDI QIDQ882780

Sarmad Abbasi, Asif Jamshed

Publication date: 24 May 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0666-z

zbMATH Keywords

probabilistic methodHamilton cycles

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (5)

A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three ⋮ On Sheehan's Conjecture for Graphs with Symmetry ⋮ Graphs with few hamiltonian cycles ⋮ On uniquely Hamiltonian claw-free and triangle-free graphs ⋮ Uniquely Hamiltonian Graphs of Minimum Degree 4

Cites Work

• Spanning cycles of nearly cubic graphs
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Chords of longest cycles in cubic graphs
• Vertices of small degree in uniquely Hamiltonian graphs
• A note concerning graphs with unique f-factors
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A degree constraint for uniquely Hamiltonian graphs