48 citations · 48 across the 1 of their papers we have counts for
1 paper
Frantisek Kardos, Daniel Král', Jozef Miskuf +1
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.