Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
From MaRDI portal
Publication:2404404
DOI10.1016/j.disc.2017.07.002zbMath1370.05123OpenAlexW2740458581MaRDI QIDQ2404404
Publication date: 18 September 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.butler.edu/cgi/viewcontent.cgi?article=2045&context=facsch_papers
Related Items (3)
On sufficient degree conditions for traceability of claw-free graphs ⋮ Hamiltonicity of claw-free graphs and Fan-type conditions ⋮ Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
Cites Work
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
- Graphs without spanning closed trails
- Hamiltonian properties of graphs with large neighborhood unions
- On dominating and spanning circuits in graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Hamiltonian claw-free graphs involving minimum degrees
- Hamiltonicity in 3-connected claw-free graphs
- Longest paths and cycles in K1,3-free graphs
- Hamilton cycles in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Generalized degree conditions for graphs with bounded independence number
- Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
- Hamiltonian cycles in 2‐connected claw‐free‐graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs
- Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
