Bipartizing fullerenes

  • Authors:

  • Zdenk Dvořák;Bernard Lidický;Riste Škrekovski

  • Affiliations:

  • Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské námstí25, 11800 Prague, Czech Republic;Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské námstí25, 11800 Prague, Czech Republic;Department of Mathematics, University of Ljubljana, Jadranska19, 1111 Ljubljana, Slovenia

  • Venue:
  • European Journal of Combinatorics
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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(n) edges. This bound is asymptotically optimal.