Longest cycles in tough graphs
H. A. Jung, Priscila Wittmann · Journal of Graph Theory · 1999
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. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 107–127, 1999