Every longest circuit of a 3-connected, ::::K::::::3, 3::-minor free graph has a chord

Etienne Birmelé. Every longest circuit of a 3-connected, ::::K::::::3, 3::-minor free graph has a chord. Journal of Graph Theory, 58(4):293-298, 2008. [doi]

Abstract

Abstract is missing.