Algorithms for Finding an Induced Cycle in Planar Graphs and Bounded Genus Graphs [chapter]

Yusuke Kobayashi, Ken-ichi Kawarabayashi
2009 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms  
In this paper, we consider the problem of finding an induced cycle passing through k given vertices, which we call the induced cycle problem.
doi:10.1137/1.9781611973068.124 fatcat:w7ovhq54lzfajij577frtpc5l4