On completing latin squares

Discrete Applied Mathematics

Volumn 113, Issue 2-3, 2001, Pages 167-181

  Easton, T ^a   Gary Parker, R ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Complexity theory; Latin square

Indexed keywords

EID: 0035887751     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00282-1     Document Type: Article

References (13)

1. Andersen L.D., Hilton A.J.W. Thank Evans! Proc. London Math. Soc. 47:1983;507-522.
2. Colbourn C. The complexity of completing partial latin squares. Discrete Appl. Math. 8:1984;151-158.
3. Colbourn C., Dinitz (Ed) J.H. The CRC Handbook of Combinatorial Designs. 1996;CRC Press, Boca Raton, Florida.
4. T. Easton, On Partial Completion Problems, Ph.D. Dissertation, Georgia Institute of Technology, Atlanta, GA, 1999.
5. M. Hall Jr., Distinct representatives of subsets, Bull. Amer. Math. Soc. (1954) 922-926.
6. Hall P. On representatives of subsets. Proc. London Math. Soc. 10:1935;26-32.
7. Hoffman A.J., Kuhn H.W. Systems of Distinct Representatives and Linear Programming. Amer. Math. Monthly. 63:1956;455-460.
8. 5/2 algorithm for maximum matching in bipartite graphs SIAM J. Comput. 2:1973;225-231.
9. Kubale M. Some results concerning the complexity of restricted colorings of graphs. Discrete Appl. Math. 36:1992;571-582.
10. Ryser H. A combinatorial theorem with application to latin rectangles. Proc. Amer. Math. Soc. 2:1951;550-552.
11. T.J. Schaefer, The complexity of satisfiability problems, Proceedings of the 10th Annual ACM Symposium on Theory of Computing, Assoc. Computing Machinery, 1978, New York, pp. 216-226.
12. Smetaniuk B. A new construction on latin squares - I: A proof of the Evans conjecture. Ars Combin. 11:1981;155-172.
13. Tuza Z., Voigt M. List colorings and reducibility. Discrete Appl. Math. 79:1997;247-256.