Planar Graphs with Many Perfect Matchings and Forests
Michael Biro · 2014
We determine the number of perfect matchings and forests in a family Tr,3 of triangulated prism graphs. These results show that the extremal number of per-fect matchings in a planar graph with n vertices is bounded below by Ω