Asymptotic enumeration of perfect matchings in $m$-barrel fullerene graphs

Afshin Behmaram, Cédric Boutillier

A connected planar cubic graph is called an $m$-barrel fullerene and denoted by $F(m,k)$, if it has the following structure: The first circle is an $m$-gon. Then $m$-gon is bounded…