Hamiltonicity of claw-free graphs and Fan-type conditions

DOI10.1016/j.disc.2018.12.008zbMath1405.05093OpenAlexW2910300564MaRDI QIDQ1727781

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

zbMATH Keywords

claw-free graphHamiltonicityobstruction setCatlin's reduction methodFan-type condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On cycle-nice claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
• New sufficient conditions for cycles in graphs
• Graphs without spanning closed trails
• On dominating and spanning circuits in graphs
• On a closure concept in claw-free graphs
• Quasi-claw-free graphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
• Note on Hamilton Circuits
• A reduction method to find spanning Eulerian subgraphs
• Almost claw‐free graphs
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• Hamiltonicity and Degrees of Adjacent Vertices in Claw‐Free Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Hamiltonicity of claw-free graphs and Fan-type conditions