The complexity of completing partial Latin squares

Research output: Contribution to journalArticle

99 Scopus citations

Abstract

Completing partial Latin squares is shown to be NP-complete. Classical embedding techniques of Hall and Ryser underly a reduction from partitioning tripartite graphs into triangles. This in turn is shown to be NP-complete using a recent result of Holyer.

Original languageEnglish (US)
Pages (from-to)25-30
Number of pages6
JournalDiscrete Applied Mathematics
Volume8
Issue number1
DOIs
StatePublished - Apr 1984
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The complexity of completing partial Latin squares'. Together they form a unique fingerprint.

  • Cite this