Longest cycles in 3-connected graphs contain three contractible edges

Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota. Longest cycles in 3-connected graphs contain three contractible edges. Journal of Graph Theory, 13(1):17-21, 1989. [doi]

Abstract

Abstract is missing.