Longest cycles in tough graphs

Journal of Graph Theory

Volumn 31, Issue 2, 1999, Pages 107-127

  Jung, H A ^a   Wittmann, P ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Circumference; Toughness

Indexed keywords

EID: 0038282263     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199906)31:2<107::AID-JGT4>3.0.CO;2-L     Document Type: Article

References (4)

1. D. Bauer, H.J. Broersma, J. van den Heuvel, and H.J. Veldman, Long cycles in graphs with prescribed toughness and minimum degree, Discrete Math 141 (1995), 1-10.
2. G. A. Dirac, Some theorems on abstract graphs, Proc London Math Soc. 2 (1952), 69-81.
3. H. A. Jung, "Long cycles in graphs with moderate connectivity" Topics in combinatorics and graph theory, R. Bodendieck and R. Henn (Editors), Physika Verlag, Heidelberg, 1990, pp. 765-778.
4. J. van den Heuvel, Updated contributions to the Twente workshop on Hamiltonian graph theory, April 6-10, 1992, H.J. Broersma, J. van den Heuvel, and H.J. Veldman (Editors), University of Twente, Enschede, The Netherlands, 1992, p. 118.