Longest cycles in tough graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199906)31:2<107::AID-JGT4>3.0.CO;2-L" /><107::AID-JGT4>3.0.CO;2-L 10.1002/(SICI)1097-0118(199906)31:2<107::AID-JGT4>3.0.CO;2-LzbMath0927.05042OpenAlexW4235225454MaRDI QIDQ4248535

P. Wittmann, Heinz A. Jung

Publication date: 5 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199906)31:2<107::aid-jgt4>3.0.co;2-l

zbMATH Keywords

Hamiltonian cyclecircumferencetoughness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Length of longest cycles in a graph whose relative length is at least two ⋮ Spanning paths in graphs ⋮ Toughness in graphs -- a survey

This page was built for publication: Longest cycles in tough graphs