✦ LIBER ✦

Longest cycles in polyhedral graphs

✍ Scribed by Hansjoachim Walther

Book ID: 112886851
Publisher: The Hebrew University Magnes Press
Year: 1993
Tongue: English
Weight: 254 KB
Volume: 83
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02764642

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Longest Simple Paths in Polyhedral Graph

Longest Simple Paths in Polyhedral Graphs

✍ Grunbaum, B.; Motzkin, T. S. 📂 Article 📅 1962 🏛 Oxford University Press 🌐 English ⚖ 203 KB

Longest cycles in threshold graphs

✍ N.V.R. Mahadev; U.N. Peled 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 495 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.

Longest cycles in 3-connected graphs

✍ B. Wei 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Longest cycles in generalized Buckminste

Longest cycles in generalized Buckminsterfullerene graphs

✍ Stanislav Jendrol'; Peter J. Owens 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 483 KB

Polyhedral graphs without hamiltonian cy

Polyhedral graphs without hamiltonian cycles

✍ Hansjoachim Walther 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 309 KB

There is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian graphs having only 5-gons and 8-gons as faces.