1. Dahlhaus, E., Karpinski, M.: Perfect matching for regular graphs is AC0-hard for the general matching problem. Journal of Computer and System Sciences 44(1), 94–102 (1992)
2. Karp, R.M., Upfal, E., Wigderson, A.: Constructing a perfect matching is in random NC. Combinatorica 6, 35–48 (1986)
3. Oxford Lecture Series in Mathematics and its Applications;M. Karpinski,1998
4. Kastelyn, P.W.: Graph theory and crystal physics. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 43–110. Academic Press, London (1967)
5. Lovasz, L.: On determinants, matchings and random algorithms. In: Budach, L. (ed.) Proceedings of Conference on Fundamentals of Computing Theory, pp. 565–574. Akademia-Verlag (1979)