arXiv Analytics

Sign in

arXiv:0801.1438 [math.CO]AbstractReferencesReviewsResources

Fullerene graphs have exponentially many perfect matchings

Frantisek Kardos, Daniel Král', Jozef Miskuf, Jean-Sébastien Sereni

Published 2008-01-09, updated 2010-05-27Version 2

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.

Comments: 7 pages, 3 figures
Journal: Journal of Mathematical Chemistry 46(2):443--447, 2009
Categories: math.CO, math-ph, math.MP
Subjects: 05C70, 92E10
Related articles: Most relevant | Search more
arXiv:2003.09602 [math.CO] (Published 2020-03-21)
The Number of Perfect Matchings in Möbius Ladders and Prisms
arXiv:1211.5640 [math.CO] (Published 2012-11-24)
2-Resonant fullerenes
arXiv:0801.3854 [math.CO] (Published 2008-01-24, updated 2011-01-24)
Long cycles in fullerene graphs

Links

Toolbox