Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
From MaRDI portal
Publication:2404404
DOI10.1016/J.DISC.2017.07.002zbMATH Open1370.05123OpenAlexW2740458581MaRDI QIDQ2404404FDOQ2404404
Authors: Zhi-Hong Chen 
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
Recommendations
- Hamiltonicity and degrees of adjacent vertices in claw-free graphs
- Publication:3491603
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
Cites Work
- Graphs without spanning closed trails
- On dominating and spanning circuits in graphs
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Hamiltonicity in 3-connected claw-free graphs
- Graph theory with applications
- Longest paths and cycles in K1,3-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- Hamiltonian claw-free graphs involving minimum degrees
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- Title not available (Why is that?)
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamilton cycles in claw-free graphs
- Hamiltonian properties of graphs with large neighborhood unions
- Hamiltonian cycles in 2‐connected claw‐free‐graphs
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
- Generalized degree conditions for graphs with bounded independence number
- Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
Cited In (18)
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Title not available (Why is that?)
- A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs
- Neighborhood union of independent sets and Hamiltonicity of claw-free graphs
- Hamiltonicity and degrees of adjacent vertices in claw-free graphs
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
- Extremal problems on the Hamiltonicity of claw-free graphs
- Degree conditions on claws and modified claws for Hamiltonicity of graphs
- Title not available (Why is that?)
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs
- On sufficient degree conditions for traceability of claw-free graphs
- Hamilton-connected claw-free graphs with Ore-degree conditions
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- Title not available (Why is that?)
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
This page was built for publication: Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2404404)
