𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamilton cycles in strong products of graphs

✍ Scribed by Daniel Král'; Jana Maxová; Robert Šámal; Pavel Podbrdský

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
229 KB
Volume
48
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We prove that the strong product of any n connected graphs of maximum degree at most n contains a Hamilton cycle. In particular, G^Δ(G)^ is hamiltonian for each connected graph G, which answers in affirmative a conjecture of Bermond, Germa, and Heydemann. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 299–321, 2005

📜 SIMILAR VOLUMES

Hamilton cycles in regular graphs
Hamilton cycles in regular graphs
✍ Bill Jackson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## UNIVERSIW OF WATERLOO ' The research reported here has been sponsored by the Canadian Commonwealth Association.

On Hamilton cycles in certain planar gra
On Hamilton cycles in certain planar graphs
✍ Sanders, Daniel P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

Let G be a 2-connected plane graph with outer cycle XG such that for every minimal vertex cut S of G with IS1 5 3, every component of G \ S contains a vertex of XG. A sufficient condition for G to be Hamiltonian is presented. This theorem generalizes both Tutte's theorem that every 4-connected plan