Longest cycles in tough graphs

Authors
Jung, HA Wittmann, P
Citation
Ha. Jung et P. Wittmann, Longest cycles in tough graphs, J GRAPH TH, 31(2), 1999, pp. 107-127
Citations number
4
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024 → ACNP
Volume
31
Issue
2
Year of publication
1999
Pages
107 - 127
Database
ISI
SICI code
0364-9024(199906)31:2<107:LCITG>2.0.ZU;2-D
Abstract
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 delta and the toughne ss t. It is shown that C is a Hamiltonian cycle or \C\ greater than or equa l to (t + 1)delta + t. (C) 1999 John Wiley & Sons, Inc.