论文信息 - On completing latin squares

On completing latin squares

Abstract In 1984, Colbourn proved that completing a partially filled latin square is NP -complete. In this paper, we tighten the Colbourn result by showing that completing a partially filled square remains hard even if no more than three unfilled cells exist in any row or column of the square and where only three integers are available.

R. Gary Parker | Todd Easton | T. Easton | R. Parker

[1] M. Hall. Distinct representatives of subsets , 1948 .

[2] H. Kuhn,et al. Systems of Distinct Representations and Linear Programming , 1956 .

[3] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[4] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[5] Zsolt Tuza,et al. List Colorings and Reducibility , 1997, Discret. Appl. Math..

[6] Dominique Garcia,et al. Mobilier d'une tombe du Premier Age du fer au lieu-dit Les Faïsses à Mourèze (Hérault) , 1985 .

[7] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.

[8] P. Hall. On Representatives of Subsets , 1935 .

[9] Marek Kubale. Some results concerning the complexity of restricted colorings of graphs , 1992, Discret. Appl. Math..

[10] Charles J. Colbourn,et al. The complexity of completing partial Latin squares , 1984, Discret. Appl. Math..

[11] H. Ryser. A combinatorial theorem with an application to latin rectangles , 1951 .

[12] Todd William Easton. On partial completion problems , 1999 .