✦ LIBER ✦

Forbidden pairs for -connected Hamiltonian graphs

✍ Scribed by Guantao Chen; Yoshimi Egawa; Ronald J. Gould; Akira Saito

Book ID: 113567487
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 232 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.10.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pairs of Hamiltonian circuits in 5-conne

Pairs of Hamiltonian circuits in 5-connected planar graphs

✍ Joseph Zaks 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 763 KB

Pancyclicity of 3-connected graphs: Pair

Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs

✍ Ronald J. Gould; Tomasz Łuczak; Florian Pfender 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB

## Abstract We characterize all pairs of connected graphs {__X__, __Y__} such that each 3‐connected {__X__, __Y__}‐free graph is pancyclic. In particular, we show that if each of the graphs in such a pair {__X__, __Y__} has at least four vertices, then one of them is the claw __K__~1,3~, while the

Hamiltonian-connected graphs

✍ Zhao Kewen; Hong-Jian Lai; Ju Zhou 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Forbidden subgraphs of graphs uniquely H

Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex

✍ George R.T. Hendry; C.J. Knickerbocker; Patti Frazer Lock; Michael Sheard 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 356 KB

Characterizing forbidden pairs for hamil

Characterizing forbidden pairs for hamiltonian properties

✍ Ralph J. Faudree; Ronald J. Gould 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 786 KB

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

On hamiltonian-connected graphs

✍ Ronald J. Gould; Xingxing Yu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 735 KB

## Abstract One of the most fundamental results concerning paths in graphs is due to Ore: In a graph __G__, if deg __x__ + deg __y__ ≧ |__V__(__G__)| + 1 for all pairs of nonadjacent vertices __x, y__ ≅ __V__(__G__), then __G__ is hamiltonian‐connected. We generalize this result using set degrees.