On uniquely Hamiltonian claw-free and triangle-free graphs
From MaRDI portal
Publication:2344006
Recommendations
- On Hamiltonian claw-free graphs
- scientific article; zbMATH DE number 889954
- Hamiltonicity in claw-free graphs
- On Hamiltonicity of \{claw, net\}-free graphs
- On Hamiltonicity of 3-connected claw-free graphs
- On Hamiltonicity of 2-connected claw-free graphs
- scientific article; zbMATH DE number 4177109
- On 1-Hamilton-connected claw-free graphs
- Hamiltonicity in \(2\)-connected claw-free graphs
- Hamiltonicity in Partly claw-free graphs
Cites work
- scientific article; zbMATH DE number 3512156 (Why is no real title available?)
- A degree constraint for uniquely Hamiltonian graphs
- Chromatic properties of Hamiltonian graphs
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- Independent dominating sets and hamiltonian cycles
- On Hamiltonian Circuits
- On the number of Hamiltonian cycles in bipartite graphs
- Spanning cycles of nearly cubic graphs
- Uniquely Hamiltonian graphs of minimum degree 4
- Vertices of small degree in uniquely Hamiltonian graphs
Cited in
(9)- On Hamiltonian claw-free graphs
- Characterizing forbidden clawless triples implying Hamiltonian graphs
- Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
- A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
- Graphs with few Hamiltonian cycles
- A degree constraint for uniquely Hamiltonian graphs
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- Vertices of small degree in uniquely Hamiltonian graphs
- Independent dominating sets and hamiltonian cycles
This page was built for publication: On uniquely Hamiltonian claw-free and triangle-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344006)
