Hamiltonicity of 2-connected quasi-claw-free graphs
type: Item
instance of: scholarly article
title: Hamiltonicity of 2-connected quasi-claw-free graphs
zbMATH Open document ID: 1049.05051
author: Rao Li
published in: Discrete Mathematics
publication date: 2004-08-06T00:00:00Z
review text: The author calls a graph quasi-claw-free if, for any two vertices \(x,y\) of distance \(2\), there exists a common neighbor \(u\) of \(x,y\) such that each neighbor of \(u\) (distinct from \(x,y\)) is also a neighbor of either \(x\) or \(y\) (or both). He then proves that a quasi-claw-free graph with \(n\) vertices and minimum degree at least \(n/4\) is Hamiltonian unless it belongs to a restricted (completely specified) class of graphs.
reviewed by: Carsten Thomassen
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 2083727
zbMATH Keywords: Hamiltonicity
zbMATH Keywords: Claw-free graphs
zbMATH Keywords: Quasi-claw-free graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2003.12.007
OpenAlex ID: W2915964335
cites work: Quasi-claw-free graphs
cites work: Q3097395
cites work: On maximal paths and circuits of graphs
cites work: Hamiltonian cycles in 2‐connected claw‐free‐graphs
DOI: 10.1016/J.DISC.2003.12.007
description: scientific article; zbMATH DE number 2083727