| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653710 | European Journal of Combinatorics | 2012 | 8 Pages |
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 nn vertices can be bipartized by removing O(n) edges. This bound is asymptotically optimal.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski,