Induced Packing of Odd Cycles in a Planar Graph

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 2O(k3/2 ) · n3 log n 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.

• Type: Conference
• Year: 2009
• Where: ISAAC
• Authors: Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
• Keywords: Edge, ISAAC 2009, Odd Cycles