Counting complete matchings without using Pfaffians

AbstractIt is known that the number of complete matchings of a planar graph can be expressed as a Pfaffian, and that the square of the Pfaffian of a matrix equals the determinant. In this paper it is shown without the use of Pfaffians that the square of the number of complete matchings equals that determinant