Toughness and longest cycles in 2-connected planar graphs

DOI<257::AID-JGT5>3.0.CO;2-R 10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-RzbMath0866.05034OpenAlexW2737714058MaRDI QIDQ4715279

Thomas Böhme, Henk Jan Veldman, Hajo J. Broersma

Publication date: 12 November 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199611)23:3<257::aid-jgt5>3.0.co;2-r

zbMATH Keywords

connectivityboundplanar graphtoughnesslongest cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

Toughness in graphs -- a survey

This page was built for publication: Toughness and longest cycles in 2-connected planar graphs