Latin Square Completion
Latin Square Completion is a combinatorial problem in design theory that involves determining whether a partially filled Latin square can be extended to a complete Latin square by filling in the remaining entries while satisfying the constraint that each symbol appears exactly once in each row and each column.
28
Publications
952
Citations
47
Authors
39
Institutions
Publications per year
2017–2026
3
Parents
28
The complexity of completing partial Latin squares
Charles J. Colbourn · Discrete Applied Mathematics · 1984 · 189 citations
Enumerating possible Sudoku grids
Bertram Felgenhauer, Frazer Jarvis · 2005 · 53 citations
1–5 of 28
47
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 47
39

Cornell University
Ithaca, United States
2 h-index
3 publications
189 citations

University of Rostock
Rostock, Germany
2 h-index
2 publications
23 citations

UNSW Sydney
Sydney, Australia
2 h-index
2 publications
29 citations
University of Reading
Reading, United Kingdom
1 h-index
1 publications
11 citations
Aalborg University
Aalborg, Denmark
1 h-index
1 publications
11 citations

University of Otago
Dunedin, New Zealand
1 h-index
1 publications
23 citations
Kuwait University
Kuwait City, Kuwait
1 h-index
1 publications
23 citations
University of Iowa
Iowa City, United States
1 h-index
1 publications
17 citations
1–8 of 39
6 publications · 110 citations
6
h-index
JCD · 5 publications · 85 citations
5
h-index
CMB · 3 publications · 60 citations
3
h-index
3 publications · 230 citations
3
h-index
1 publications · 11 citations
1
h-index
1–5