Sciweavers

Share
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
9 years 11 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 t...
Petr A. Golovach, Marcin Kaminski, Daniël Pau...
books