Hamiltonicity in 2-connected graphs with claws
type: Item
instance of: scholarly article
title: Hamiltonicity in 2-connected graphs with claws
zbMATH Open document ID: 0893.05009
DOI: 10.1016/S0012-365X(97)00056-3
author: Hao Li
author: Mei Lu
author: Zhiren Sun
published in: Discrete Mathematics
publication date: 1998-08-11T00:00:00Z
review text: Several papers have been written on claw-free graphs (a graph is claw-free if it does not contain a copy of \(K_{1,3}\) as an induced subgraph). In particular, \textit{M. Matthews} and \textit{D. Sumner} [J. Graph Theory 8, 139-146 (1984; Zbl 0536.05047); ibid. 9, 269-277 (1985; Zbl 0591.05041)] considered conditions under which a claw-free graph is hamiltonian. In the present paper the authors consider conditions for a 2-connected graph with claws to be hamiltonian.
reviewed by: E. J. F. Primrose
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1130776
zbMATH Keywords: claw-free graphs
zbMATH Keywords: hamiltonian
MaRDI profile type: Publication
cites work: Q5422499
cites work: Toughness and hamiltonicity in almost claw-free graphs
cites work: Some Theorems on Abstract Graphs
cites work: On Hamiltonian claw-free graphs
cites work: Dominating cycles in regular 3-connected graphs
cites work: Hamiltonian cycles in \(2\)-connected claw-free graphs
cites work: Hamiltonian cycles in 3‐connected claw‐free graphs
cites work: Hamiltonian cycles in 3-connected claw-free graphs
cites work: Hamiltonian results inK1,3-free graphs
cites work: Longest paths and cycles in K1,3-free graphs
cites work: Hamilton cycles in claw-free graphs
full work available at URL: s0012-365x(97)00056-3
OpenAlex ID: W2059242370
description: scientific article; zbMATH DE number 1130776