Enumeration of perfect matchings in some type polyminoes
Xiaoxia Lin · Fuzhou daxue xuebao. Ziran kexue ban · 2005
Enumeration of perfect matchings of graphs is an important subject in the matching theory.But the enumeration problem for perfect matchings in general graphs is NP-hard.In this paper,explicit formules for the number of the perfect matchings in some type polyminoes are deduced by recursive calculation.