Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs

DOI10.1007/s00373-016-1716-9zbMath1353.05068OpenAlexW2402119833MaRDI QIDQ503616

Zhi-Hong Chen

Publication date: 13 January 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1716-9

zbMATH Keywords

independence numberclaw-free graphHamiltonian cyclematching numberChvátal-Erdős condition

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

Circumferences of 3-connected claw-free graphs. II. ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ On sufficient degree conditions for traceability of claw-free graphs ⋮ Hamiltonicity of claw-free graphs and Fan-type conditions ⋮ On the independence number of traceable 2-connected claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning closed trails in graphs
• Graphs without spanning closed trails
• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
• 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
• Spanning trails with variations of Chvátal-Erdős conditions
• Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
• A note on Hamiltonian circuits
• Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Collapsible graphs and matchings
• On Eulerian and Hamiltonian Graphs and Line Graphs
• The Factorization of Linear Graphs