Valiant, Leslie G. (2004). „Holographic Algorithms (Extended Abstract)”. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. FOCS'04. Rome, Italy: IEEE Computer Society. стр. 306—315. ISBN978-0-7695-2228-9. doi:10.1109/FOCS.2004.34. Архивирано из оригинала|archive-url= захтева |url= (помоћ) 13. 03. 2012. г.|access-date= захтева |url= (помоћ)
doi.org
Kasteleyn, P. W. (1961), „The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice”, Physica, 27 (12): 1209—1225, doi:10.1016/0031-8914(61)90063-5
Temperley, H. N. V.; Fisher, Michael E. (1961). „Dimer problem in statistical mechanics-an exact result”. Philosophical Magazine. 6 (68): 1061—1063. doi:10.1080/14786436108243366.
Kasteleyn, P. W. (1963). „Dimer Statistics and Phase Transitions”. Journal of Mathematical Physics. 4 (2): 287—293. doi:10.1063/1.1703953.
Vazirani, Vijay V. (1988), „NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems”, Proc. 1st Scandinavian Workshop on Algorithm Theory (SWAT '88), Lecture Notes in Computer Science, 318, Springer-Verlag, стр. 233—242, doi:10.1007/3-540-19487-8_27
Valiant, Leslie G. (2004). „Holographic Algorithms (Extended Abstract)”. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. FOCS'04. Rome, Italy: IEEE Computer Society. стр. 306—315. ISBN978-0-7695-2228-9. doi:10.1109/FOCS.2004.34. Архивирано из оригинала|archive-url= захтева |url= (помоћ) 13. 03. 2012. г.|access-date= захтева |url= (помоћ)