Fullerene graphs have exponentially many perfect matchings

Details Fullerene graphs have exponentially many perfect matchings Fullerene graphs have exponentially many perfect matchings

2008-01-09

arxiv.org/abs/0801.1438v2

Journal of Mathematical Chemistry 46(2):443--447, 2009

Mathematics

Combinatorics

7 pages, 3 figures

Scientific paper

10.1007/s10910-008-9471-7

A fullerene graph is a planar cubic 3-connected graph with only pentagonal
and hexagonal faces. We show that fullerene graphs have exponentially many
perfect matchings.

Affiliated with

Also associated with

No associations

Rating

Fullerene graphs have exponentially many perfect matchings 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 Fullerene graphs have exponentially many perfect matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fullerene graphs have exponentially many perfect matchings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-670157