• Citer

Approximate min-max relations for odd cycles in planar graphs

par Fiorini, Samuel ;Hardy, nadia;Reed, Bruce;Vetta, Adrian
Référence Lecture notes in computer science, 3509, page (35-50)
Publication Publié, 2005

Article révisé par les pairs

• Détails
• Contenu

Résumé :

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ál and Voss [7] recently proved that this ratio is at most 2; we also give a short proof of their result. © Springer-Verlag Berlin Heidelberg 2005.