Bipartizing fullerenes
Combinatorics
2018-10-26 v1
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.
Keywords
Cite
@article{arxiv.1106.0420,
title = {Bipartizing fullerenes},
author = {Zdenek Dvorak and Bernard Lidicky and Riste Skrekovski},
journal= {arXiv preprint arXiv:1106.0420},
year = {2018}
}
Comments
14 pages, 4 figures