Hamiltonicity of claw-free graphs and Fan-type conditions
From MaRDI portal
Publication:1727781
DOI10.1016/J.DISC.2018.12.008zbMATH Open1405.05093OpenAlexW2910300564WikidataQ128616252 ScholiaQ128616252MaRDI QIDQ1727781FDOQ1727781
Authors: Zhi-Hong Chen 
Publication date: 20 February 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.12.008
Recommendations
- scientific article; zbMATH DE number 7274067
- A Fan-type condition for claw-free graphs to be Hamiltonian
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
Cites Work
- Graph theory
- Graphs without spanning closed trails
- On dominating and spanning circuits in graphs
- On a closure concept in claw-free graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Note on Hamilton Circuits
- 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
- Some Theorems on Abstract Graphs
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Hamiltonicity and degrees of adjacent vertices in claw-free graphs
- New sufficient conditions for cycles in graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Title not available (Why is that?)
- Quasi-claw-free graphs
- Almost claw‐free graphs
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
Cited In (4)
This page was built for publication: Hamiltonicity of claw-free graphs and Fan-type conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1727781)
