The complexity of completing partial Latin squares

1984/04/01 by Charles J. Colbourn · 4 citations
Computer Science · Engineering · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · doi:10.1016/0166-218x(84)90075-1

crossref issued 1984/04/01 · crossref published 1984/04/01 · crossref published-print 1984/04/01 · openalex publication_date 1984/04/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/18 · crossref indexed 2026/08/05

Citations

• The NP-Completeness of Some Edge-Partition Problems
• On Representatives of Subsets
• An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs

Cited by

• Complexity of n-Queens Completion
• Complexity of Token Swapping and its Variants
• Latin square [wikipedia]
• P versus NP problem [wikipedia]