✦ LIBER ✦

Determinants and Longest Cycles of Graphs

✍ Scribed by Ejov, Vladimir; Filar, Jerzy A.; Murray, Walter; Nguyen, Giang T.

Book ID: 118196999
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 161 KB
Volume: 22
Category: Article
ISSN: 0895-4801
DOI: 10.1137/070693898

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 polyhedral graphs

✍ Hansjoachim Walther 📂 Article 📅 1993 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 254 KB

Longest cycles in threshold graphs

✍ N.V.R. Mahadev; U.N. Peled 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 495 KB

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

Intersections of longest cycles in grid

Intersections of longest cycles in grid graphs

✍ Menke, B.; Zamfirescu, T.; Zamfirescu, C. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 292 KB 👁 3 views

It is well-known that the largest cycles of a graph may have empty intersection. This is the case, for example, for any hypohamiltonian graph. In the literature, several important classes of graphs have been shown to contain examples with the above property. This paper investigates a (nontrivial) cl