Recognition: unknown
Bipartizing fullerenes
classification
🧮 math.CO
keywords
facesgraphfullereneasymptoticallybipartizedbipartizingboundbridgeless
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.