Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
type: Item
instance of: scholarly article
title: Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
zbMATH Open document ID: 0995.05086
DOI: 10.1016/S0012-365X(01)00141-8
author: Rao Li
author: R. H. Schelp
published in: Discrete Mathematics
publication date: 2002-05-15T00:00:00Z
review text: A graph containing no induced subgraph isomorphic to \(K_{1,3}\) is said to be claw-free. This paper has been inspired by a result of \textit{M.~Li} [J. Graph Theory 17, 303-313 (1993; Zbl 0778.05056)] saying that any 3-connected claw-free graph of order \(n\) and minimum degree at least \((n+5)/5\) is Hamiltonian. The authors prove that the theorem holds even if the claw-free condition is replaced by the weaker assumption that \(G\) does not contain any induced subgraph isomorphic to \(K_{1,4}\) or \(K_{1,4}+e\), provided \(n\geq 30\).
reviewed by: Tomáš Dvořák
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1741686
zbMATH Keywords: Hamiltonicity
zbMATH Keywords: \(\{K_{1,4}, K_{1,4}+e\}\)-free graph
MaRDI profile type: Publication
full work available at URL: s0012-365x(01)00141-8
OpenAlex ID: W1536638005
description: scientific article; zbMATH DE number 1741686