Informace o publikaci
Fullerene graphs have exponentially many perfect matchings
| Autoři | |
|---|---|
| Rok publikování | 2009 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | JOURNAL OF MATHEMATICAL CHEMISTRY |
| Citace | |
| Doi | http://dx.doi.org/10.1007/s10910-008-9471-7 |
| Klíčová slova | Fullerene; Fullerene graph; Perfect matching |
| Popis | 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. |