 This result stands in contrast to the much higher computational complexity of counting matchings in arbitrary graphs.A graph is said to be Pfaffian if it has a Pfaffian orientation.Every planar graph is Pfaffian.