Abstract
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in time when the input graph is planar. We also show that deciding if a graph has an induced packing of two odd cycles is NP-complete. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Golovach, P. A., Kamiński, M., Paulusma, D., & Thilikos, D. M. (2009). Induced packing of odd cycles in a planar graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 514–523). Springer Verlag. https://doi.org/10.1007/978-3-642-10631-6_53
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
