Sciweavers

Share
ISAAC
2009
Springer

Induced Packing of Odd Cycles in a Planar Graph

8 years 10 months ago
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.
Petr A. Golovach, Marcin Kaminski, Daniël Pau
Added 25 Jul 2010
Updated 25 Jul 2010
Type Conference
Year 2009
Where ISAAC
Authors Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
Comments (0)
books