Forbidden triples for hamiltonicity

Authors:
Jan Brousek
Affiliations:
Department of Mathematics, University of West Bohemia, P.O. Box 314, 306 14 Plzen, Czech Republic
Venue:
Discrete Mathematics
Year:
2002

Citing 2
Cited 1

Minimal 2-connected non-hamiltonian claw-free graphs

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications

Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity

Information Processing Letters

Quantified Score

Hi-index	0.05

Visualization

Abstract

In this paper we characterize all triples of connected graphs C,X,Y (where C is a claw) and such that every 2-connected CXY-free graph G is hamiltonian. This result together with a previous result by Faudree, Gould, Jacobson, and Lesniak give a full characterization of triples of forbidden subgraphs implying hamiltonicity of 2-connected graphs.