Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

STOC
2010
ACM

favoriteEmaildiscussreport

274views Algorithms» more STOC 2010»

Odd Cycle Packing

14 years 8 months ago

Odd Cycle Packing

Download homepages.ulb.ac.be

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

Real-time Traffic

Algorithms | Odd Cycle Packing | Odd Cycle Transversal | Odd Cycle Vertex | STOC 2010 |

claim paper

Related Content

» Induced Packing of Odd Cycles in a Planar Graph

» Packing 5cycles into balanced complete m partite graphs for odd m

» Transitive Packing

» Identifying codes of cycles with odd orders

» On Odd and Even Cycles in Normal Logic Programs

» Compression via matroids a randomized polynomial kernel for odd cycle transversal

» A Note on Odd CycleComplete Graph Ramsey Numbers

» The upper bound of the number of cycles in a 2factor of a line graph

» The Directed AntiOberwolfach Solution Pancyclic 2Factorizations of Complete Directed Graph...

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	STOC
Authors	Ken-ichi Kawarabayashi and Bruce Reed

Comments (0)