Sciweavers

Share
STOC
2010
ACM

Odd Cycle Packing

10 years 4 months ago
Odd Cycle Packing
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that this ratio is at most 10. For the corresponding edge version of this problem, Kr?al and Voss recently proved that this ratio is at most 2; we also give a short proof of their result. Keywords Odd cycle transversal ? Odd cycle packing ? Planar graph
Ken-ichi Kawarabayashi and Bruce Reed
Added 01 Mar 2010
Updated 02 Mar 2010
Type Conference
Year 2010
Where STOC
Authors Ken-ichi Kawarabayashi and Bruce Reed
Comments (0)
books