1. The size of the smallest strong critical set in a Latin square;Bate;Ars. Combin.,1999
2. Secret sharing schemes arising from Latin squares;Cooper;Bull. Inst. Combin. Appl.,1994
3. D. Curran, G.H.J. Van Rees, Critical sets in Latin squares, Proceedings of the Eighth Manitoba Conference on Numerical Mathematics and Computing, University of Manitoba, Winnipeg, Man., 1978, Congressus Numerantium, XXII, Utilitas Math., Winnipeg, Man., 1979, pp. 165–168.
4. Computers and Intractability, A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences;Garey,1979
5. On the minimum number of blocks defining a design;Gray;Bull. Austral. Math. Soc.,1990