Fullerene graphs have exponentially many perfect matchings

František Kardoš,Daniel Král,Jozef Miškuf,Jean-Sébastien Sereni

Fullerene graphs have exponentially many perfect matchings

2009

František Kardoš
Daniel Král
Jozef Miškuf
Jean-Sébastien Sereni

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.

Keywords:

Planar graph
Matching (graph theory)
Fullerene
Combinatorics
Cubic graph
Connectivity
Planar
Mathematical chemistry
Exponential growth
Physics

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations