Vertices of small degree in uniquely Hamiltonian graphs
From MaRDI portal
Publication:1569030
DOI10.1006/JCTB.1998.1845zbMath1026.05071OpenAlexW2028767175MaRDI QIDQ1569030
Publication date: 25 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1845
Related Items (12)
Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Regular Graphs with Few Longest Cycles ⋮ A degree constraint for uniquely Hamiltonian graphs ⋮ A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three ⋮ On Sheehan's Conjecture for Graphs with Symmetry ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Long cycles in Hamiltonian graphs ⋮ Graphs with few hamiltonian cycles ⋮ Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs ⋮ $K_2$-Hamiltonian Graphs: I ⋮ On uniquely Hamiltonian claw-free and triangle-free graphs ⋮ Uniquely Hamiltonian Graphs of Minimum Degree 4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning cycles of nearly cubic graphs
- 4-connected projective planar graphs are Hamiltonian
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- Chords of longest cycles in cubic graphs
- On the Number of Hamiltonian Cycles in Bipartite Graphs
- A note concerning graphs with unique f-factors
- A Theorem on Planar Graphs
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Extremal maximal uniquely hamiltonian graphs
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
- Some Theorems on Abstract Graphs
- On Hamiltonian Circuits
This page was built for publication: Vertices of small degree in uniquely Hamiltonian graphs