Finding an induced path of given parity in planar graphs in polynomial time

Marcin Kaminski, Naomi Nishimura. Finding an induced path of given parity in planar graphs in polynomial time. In Yuval Rabani, editor, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012. pages 656-670, SIAM, 2012. [doi]

Abstract

Abstract is missing.