2 papers
math.CO2017
Asymptotic enumeration of perfect matchings in -barrel fullerene graphs
Afshin Behmaram, Cédric Boutillier
A connected planar cubic graph is called an -barrel fullerene and denoted by , if it has the following structure: The first circle is an -gon. Then -gon is bounded…
math.CO2012
Upper bounds for perfect matchings in pfaffian and planar graphs
Afshin Behmaram, Shmuel Friedland
We give upper bounds on weighted perfect matchings in pfaffian graphs. These upper bounds are better than Bregman's upper bounds on the number of perfect matchings. We show that so…