Skip to main content
profile image
Selected Works of Bernard Lidický
Article
Bipartizing fullerenes
European Journal of Combinatorics (2012)
  • Zdeněk Dvořák, Charles University
  • Bernard Lidicky, Charles University
  • Riste Škrekovskib, University of Ljubljana
Download Find in your library
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 vertices can be bipartized by removing edges. This bound is asymptotically optimal.
Disciplines
Publication Date
August, 2012
DOI
10.1016/j.ejc.2012.03.028
Publisher Statement
This is a manuscript of an article published aDvořák, Zdeněk, Bernard Lidický, and Riste Škrekovski. "Bipartizing fullerenes." European Journal of Combinatorics 33, no. 6 (2012): 1286-1293. DOI: 10.1016/j.ejc.2012.03.028. Copyright 2012 Elsevier Ltd. Posted with permission.

Citation Information
Zdeněk Dvořák, Bernard Lidicky and Riste Škrekovskib. "Bipartizing fullerenes" European Journal of Combinatorics Vol. 33 Iss. 6 (2012) p. 1286 - 1293
Available at: http://works.bepress.com/bernard-lidicky/19/
Creative Commons license
Creative Commons License
This work is licensed under a Creative Commons CC_BY-NC-ND International License.