Forbidden triples for Hamiltonicity
type: Item
instance of: scholarly article
title: Forbidden triples for Hamiltonicity
zbMATH Open document ID: 1002.05044
DOI: 10.1016/S0012-365X(01)00326-0
author: Jan Brousek
published in: Discrete Mathematics
publication date: 2002-08-29T00:00:00Z
review text: If \(X\), \(Y\), \(Z\) are graphs, we say that a graph \(G\) is \(XYZ\)-free if \(G\) does not contain \(X\), \(Y\) or \(Z\) as an induced subgraph. The author characterizes all triples of connected graphs \(C\), \(X\), \(Y\), where \(C\) is the claw \(K_{1,3}\), such that every \(2\)-connected \(CXY\)-free graph is Hamiltonian. This result together with a previous result of Faudree, Gould, Jacobson and Lesniak gives a complete characterization of triples of forbidden subgraphs implying Hamiltonicity of \(2\)-connected graphs.
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1792399
zbMATH Keywords: characterization
zbMATH Keywords: forbidden subgraphs
zbMATH Keywords: Hamiltonicity
MaRDI profile type: Publication
Recommended article: Forbidden triples implying Hamiltonicity: for all graphs
Recommended article: Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
Recommended article: Closure and forbidden pairs for Hamiltonicity
Recommended article: On Forbidden Pairs Implying Hamilton‐Connectedness
Recommended article: Characterizing forbidden clawless triples implying Hamiltonian graphs
Recommended article: Forbidden pairs for \(k\)-connected Hamiltonian graphs
Recommended article: Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
Recommended article: Forbidden triples for perfect matchings
Recommended article: Characterizing forbidden pairs for Hamiltonian squares
Recommended article: Q4393306
description: scientific article; zbMATH DE number 1792399