✦ LIBER ✦

Hamiltonian cycles in 1-tough graphs

✍ Scribed by Bing Wei

Publisher: Springer Japan
Year: 1996
Tongue: English
Weight: 710 KB
Volume: 12
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01858471

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

1-Tough cocomparability graphs are hamil

1-Tough cocomparability graphs are hamiltonian

✍ Jitender S. Deogun; Dieter Kratsch; George Steiner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Longest cycles in tough graphs

✍ Jung, H.A.; Wittmann, P. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 347 KB 👁 2 views

In this article, we establish bounds for the length of a longest cycle C in a 2-connected graph G in terms of the minimum degree δ and the toughness t. It is shown that C is a Hamiltonian cycle or |C| ≥ (t + 1)δ + t.

Small cycles in Hamiltonian graphs

✍ Uwe Schelten; Ingo Schiermeyer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 733 KB

We prove that if a graph G on n > 32 vertices is hamiltonian and has two nonadjacent vertices u and u with d(u) + d(u) 3 n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 < m < 1/5(n + 13).

Hamiltonian cycles in bipartite graphs

✍ Xiaoyun Lu 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 389 KB

Hamiltonian cycles in Dirac graphs

✍ Bill Cuckler; Jeff Kahn 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 606 KB

Long paths and cycles in tough graphs

✍ H. J. Broersma; J. van den Heuvel; H. A. Jung; H. J. Veldman 📂 Article 📅 1993 🏛 Springer Japan 🌐 English ⚖ 575 KB