๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Longest cycles in generalized Buckminsterfullerene graphs

โœ Scribed by Stanislav Jendrol'; Peter J. Owens

Book ID
105102776
Publisher
Springer
Year
1995
Tongue
English
Weight
483 KB
Volume
18
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Longest cycles in polyhedral graphs
Longest cycles in polyhedral graphs
โœ Hansjoachim Walther ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› The Hebrew University Magnes Press ๐ŸŒ English โš– 254 KB
Longest cycles in threshold graphs
Longest cycles in threshold graphs
โœ N.V.R. Mahadev; U.N. Peled ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 495 KB
Longest cycles in tough graphs
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.