Premium
Longest cycles in tough graphs
Author(s) -
Jung H.A.,
Wittmann P.
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199906)31:2<107::aid-jgt4>3.0.co;2-l
Subject(s) - combinatorics , mathematics , hamiltonian path , graph , pancyclic graph , discrete mathematics , graph theory , line graph , 1 planar graph
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