1. C. Colbourn, “The complexity of completing partial Latin squares,” Discrete Appl. Math., 8, 25–30 (1984).
2. K. A. Rybnikov, An Introduction to Combinatorial Analysis [in Russian], Izd. Mosk. Univ., Moscow (1985).
3. V. N. Sachkov, An Introduction to Combinatorial Methods of Discrete Mathematics [in Russian], Nauka, Moscow (1982).
4. http://en.wikipedia.org/wiki/Latin-square .
5. B. D. McKay, J.C. McLeod, and I. M. Wanless, “The number of transversals in a Latin square,” Des. Codes Crypt., 40, 269–284 (2006).