Bipartizing fullerenes

Details Bipartizing fullerenes Bipartizing fullerenes

2011-06-02

arxiv.org/abs/1106.0420v1

Mathematics

Combinatorics

14 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bipartizing fullerenes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bipartizing fullerenes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bipartizing fullerenes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-495226