Fullerene graphs have exponentially many perfect matchings
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.
math.CO↗
arXiv subjects
Jozef Miskuf
Publications and source records attributed to Jozef Miskuf.