|
|||||
|
|
Fullerene graphs have exponentially many perfect matchings |
|
| Authors: | František Kardoš Daniel Král’ Jozef Miškuf Jean-Sébastien Sereni |
| Affiliation: | (1) Institute of Mathematics, Faculty of Science, University of Pavol Jozef Šafárik, Jesenná 5, 041 54 Košice, Slovakia;(2) Institute for Theoretical Computer Science (ITI), Faculty of Mathematics and Physics, Charles University, Malostranské Náměstí 25, 118 00 Prague, Czech Republic;(3) Department of Applied Mathematics (KAM) and DIMATIA, Faculty of Mathematics and Physics, Charles University, Malostranské Náměstí 25, 118 00 Prague, Czech Republic |
| Abstract: | 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: | Fullerene Fullerene graph Perfect matching |
| 本文献已被 SpringerLink 等数据库收录！ | |