Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (2005)

by Sergio Cabello, Bojan Mohar
Venue:In Proceedings 13th European Symp. Algorithms