Bipartizing fullerenes
arXiv:1106.0420 · doi:10.1016/j.ejc.2012.03.028
Abstract
A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O(sqrt{n}) edges. This bound is asymptotically optimal.
14 pages, 4 figures