Enumeration of perfect matchings of lattice graphs by Pfaffians

Enumeration of perfect matchings in general graphs (even in bipartite graphs) is #P-complete. In this paper, we obtain explicit expressions of the number of perfect matchings of 8.6.4 lattices with toroidal boundary by enumerating Pfaffians.