Fullerene graphs have exponentially many perfect matchings
Résumé
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.
Jean-Sébastien Sereni : Connectez-vous pour contacter le contributeur
https://hal.science/hal-00487070
Soumis le : jeudi 27 mai 2010-18:18:06
Dernière modification le : jeudi 14 mars 2024-03:09:08