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(n) edges. This bound is asymptotically optimal.
['Zdenk Dvořák', 'Bernard Lidický', 'Riste Škrekovski']
Bipartizing fullerenes