𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterizing forbidden pairs for hamiltonian properties

✍ Scribed by Ralph J. Faudree; Ronald J. Gould

Book ID
104113712
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
786 KB
Volume
173
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Closure and Forbidden Pairs for Hamilton
Closure and Forbidden Pairs for Hamiltonicity
✍ ZdenΔ›k RyjÑček πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 223 KB

Let C be the claw K 1;3 and N the net, i.e. the only connected graph with degree sequence 333111. It is known (Bedrossian, Thesis, Memphis State University, USA, 1991; Faudree and Gould, Discrete Math. 173 (1997), 45-60) that if X ; Y is a pair of connected graphs, then, for any 2-connected graph G;