Publication details
Fullerene graphs have exponentially many perfect matchings
| Authors | |
|---|---|
| Year of publication | 2009 |
| Type | Article in Periodical |
| Magazine / Source | JOURNAL OF MATHEMATICAL CHEMISTRY |
| Citation | |
| Doi | http://dx.doi.org/10.1007/s10910-008-9471-7 |
| Keywords | Fullerene; Fullerene graph; Perfect matching |
| Description | 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. |