Abstract
Let $\nu(G)$ be the maximum number of vertex-disjoint odd cycles of a graph $G$ and $\tau(G)$ the minimum number of vertices whose removal makes $G$ bipartite. We show that $\tau(G)\le 6\nu(G)$ if $G$ is planar. This improves the previous bound $\tau(G)\le 10\nu(G)$ by Fiorini et al. [Math. Program. Ser. B, 110 (2007), pp. 71--91].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
