Hamiltonicity and minimum degree in 3-connected claw-free graphs
type: Item
instance of: scholarly article
title: Hamiltonicity and minimum degree in 3-connected claw-free graphs
zbMATH Open document ID: 1024.05056
author: Pierre Fraisse
author: Odile Favaron
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1843774
zbMATH Keywords: claw
zbMATH Keywords: Hamiltonian
MaRDI profile type: Publication
full work available at URL: jctb.2001.2039
OpenAlex ID: W1992542849
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: A nine point theorem for 3-connected graphs
cites work: When m vertices in a k-connected graph cannot be walked round along a simple cycle
cites work: Hamiltonian results inK1,3-free graphs
cites work: On a closure concept in claw-free graphs
DOI: 10.1006/JCTB.2001.2039
description: scientific article; zbMATH DE number 1843774