Approximate Min-max Relations for Odd Cycles in Planar Graphs
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  recently proved that this ratio is at most 2; we also give a short proof of their result.
Unable to display preview. Download preview PDF.
- 2.Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol. 173. Springer, New-York (2000)Google Scholar
- 4.Frank, A.: A survey on T-joins, T-cuts, and conservative weightings. In Combinatorics, Paul Erdös is eighty, 2, Keszthely (1993), vol. 2 of Bolyai Society Mathematical Studies, pp. 213–252. János Bolyai Mathematical Society, Budapest (1996)Google Scholar