On completing latin squares

DOI10.1016/S0166-218X(00)00282-1zbMath0987.05024OpenAlexW2068508408MaRDI QIDQ5951961

R. Gary Parker, Todd Easton

Publication date: 19 June 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00282-1

zbMATH Keywords

NP-complete problemslatin squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (3)

On the complexity of pattern feasibility problems in time-relaxed sports timetabling ⋮ The Sudoku completion problem with rectangular hole pattern is NP-complete ⋮ Handling fairness issues in time-relaxed tournaments with availability constraints

Cites Work

• Unnamed Item
• Unnamed Item
• List colorings and reducibility
• Thank Evans!
• Systems of Distinct Representations and Linear Programming
• On Representatives of Subsets
• The complexity of satisfiability problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Distinct representatives of subsets
• A Combinatorial Theorem with an Application to Latin Rectangles

This page was built for publication: On completing latin squares