Characterizing forbidden pairs for hamiltonian properties 1
نویسندگان
چکیده
In this paper we characterize those pairs of forbidden subgraphs sufficient to imply various hamiltonian type properties in graphs. In particular, we find all forbidden pairs sufficient, along with a minor connectivity condition, to imply a graph is traceable, hamiltonian, pancyclic, panconnected or cycle extendable. We also consider the case of hamiltonian-connected graphs and present a result concerning the pairs for such graphs.
منابع مشابه
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs
For an integer kwith k ≥ 2 and a pair of connected graphs F1 and F2 of order at least three, we say that {F1, F2} is a k-forbidden pair if every k-connected {F1, F2}-free graph, except possibly for a finite number of exceptions, is Hamiltonian. If no exception arises, {F1, F2} is said to be a strong k-forbidden pair. The 2-forbidden pairs and the strong 2-forbidden pairs are determined by Faudr...
متن کاملCharacterizing Forbidden Pairs for Hamiltonian Squares
The square of a graph is obtained by adding additional edges joining all pair of vertices of distance two in the original graph. Particularly, if C is a hamiltonian cycle of a graph G, then the square of C is called a hamiltonian square of G. In this paper, we characterize all possible forbidden pairs, which implies the containment of a hamiltonian square, in a 4-connected graph. The connectivi...
متن کاملForbidden subgraphs for hamiltonicity of 1-tough graphs
A graph G is said to be 1-tough if for every vertex cut S of G, the number of components of G − S does not exceed |S|. Being 1-tough is an obvious necessary condition for a graph to be hamiltonian, but it is not sufficient in general. We study the problem of characterizing all graphs H such that every 1-tough H-free graph is hamiltonian. We almost obtain a complete solution to this problem, lea...
متن کاملForbidden subgraphs and the existence of a 2-factor
For a connected graph H, a graph G is said to be H-free if G does not contain an induced subgraph which is isomorphic to H, and for a set of connected graphs H, G is said to be H-free if G is H-free for every H ∈ H. The set H is called a forbidden subgraph. In particular, if |H| = 2 (resp. |H| = 3), we often call H a forbidden pair (resp. forbidden triple). In 1991, Bedrossian proved that there...
متن کاملCharacterizing forbidden clawless triples implying hamiltonian graphs
In this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, su2cient to imply that a 2-connected graph of su2ciently large order is hamiltonian. c © 2002 Elsevier Science B.V. All rights reserved.
متن کامل