Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
type: Item
instance of: scholarly article
title: Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
zbMATH Open document ID: 1353.05068
author: Zhi-Hong Chen
published in: Graphs and Combinatorics
publication date: 2017-01-13T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 6674426
zbMATH Keywords: claw-free graph
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: Chvátal-Erdős condition
zbMATH Keywords: independence number
zbMATH Keywords: matching number
MaRDI profile type: Publication
full work available at URL: s00373-016-1716-9
OpenAlex ID: W2402119833
cites work: Q3258698
cites work: Q5422499
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Graphs without spanning closed trails
cites work: Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
cites work: Q5740779
cites work: Spanning closed trails in graphs
cites work: Collapsible graphs and matchings
cites work: Spanning trails with variations of Chvátal-Erdős conditions
cites work: A note on Hamiltonian circuits
cites work: On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
cites work: On a closure concept in claw-free graphs
cites work: The Factorization of Linear Graphs
cites work: On dominating and spanning circuits in graphs
cites work: Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
DOI: 10.1007/S00373-016-1716-9
description: scientific article; zbMATH DE number 6674426