@inproceedings{bd2f6ec3aca942fc8b6af2caf0a1e937,
title = "Induced packing of odd cycles in a planar graph",
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.",
author = "Golovach, {Petr A.} and Marcin Kami{\'n}ski and Dani{\"e}l Paulusma and Thilikos, {Dimitrios M.}",
year = "2009",
doi = "10.1007/978-3-642-10631-6_53",
language = "English (US)",
isbn = "3642106307",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "514--523",
booktitle = "Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings",
note = "20th International Symposium on Algorithms and Computation, ISAAC 2009 ; Conference date: 16-12-2009 Through 18-12-2009",
}