Min-max relations for odd cycles in planar graphs
Combinatorics
2011-08-23 v1
Abstract
Let m(G) be the maximum number of vertex-disjoint odd cycles of a graph G and t(G) the minimum number of vertices whose removal makes G bipartite. We show that t(G)<=6m(G) if G is planar. This improves the previous bound t(G)<=10m(G) by Fiorini, Hardy, Reed and Vetta [Math. Program. Ser. B 110 (2007), 71-91].
Keywords
Cite
@article{arxiv.1108.4281,
title = {Min-max relations for odd cycles in planar graphs},
author = {Daniel Kral and Jean-Sebastien Sereni and Ladislav Stacho},
journal= {arXiv preprint arXiv:1108.4281},
year = {2011}
}