Characterizing forbidden clawless triples implying Hamiltonian graphs
type: Item
instance of: scholarly article
title: Characterizing forbidden clawless triples implying Hamiltonian graphs
zbMATH Open document ID: 0990.05091
DOI: 10.1016/S0012-365X(01)00235-7
author: Ronald Gould
author: Ralph Faudree
author: Michael Jacobson
author: Linda Lesniak
published in: Discrete Mathematics
publication date: 2002-05-28T00:00:00Z
review text: The authors characterize those forbidden triples of graphs, no one of which is a generalized claw, sufficient to imply that a 2-connected graph of sufficiently large order is Hamiltonian. In addition, the authors present some interesting open problems.
reviewed by: Lutz Volkmann
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1746277
zbMATH Keywords: Hamiltonian graph
zbMATH Keywords: forbidden triples
MaRDI profile type: Publication
Recommended article: Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
Recommended article: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
Recommended article: Hamiltonicity in 3-connected claw-free graphs
Recommended article: On Hamiltonicity of 3-connected claw-free graphs
Recommended article: On uniquely Hamiltonian claw-free and triangle-free graphs
Recommended article: Forbidden triples implying Hamiltonicity: for all graphs
Recommended article: Hamiltonicity in claw-free graphs
Recommended article: On Hamiltonian claw-free graphs
Recommended article: Hamiltonicity of 3-connected quasi-claw-free graphs.
Recommended article: Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
description: scientific article; zbMATH DE number 1746277