Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete

DOI10.1016/J.DISC.2008.05.037MaRDI QIDQ1044937zbMATH OpenOpenAlexFDO

Authors Darryn Bryant

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.05.037

zbMATH Keywords

commutative quasigrouppartial Steiner triple systemquasigrouptriple system

Mathematics Subject Classification ID

Triple systems (05B07) Loops, quasigroups (20N05)

Recommendations

• Some NP-completeness results on partial Steiner triple systems and parallel classes.
• Polynomially complete quasigroups of prime order
• The complexity of completing partial Latin squares
• On completing latin squares
• On a class of completable partial edge-colourings

Cites work

• Embedding Partial Steiner Triple Systems
• Embedding partial Steiner triple systems is NP-complete
• Embeddings of partial Steiner triple systems
• On a class of completable partial edge-colourings
• The complexity of completing partial Latin squares
• The NP-Completeness of Edge-Coloring

Cited in

(4)

• Embedding partial totally symmetric quasigroups.
• Some NP-completeness results on partial Steiner triple systems and parallel classes.
• ON COMPLETING PARTIAL GROUPOIDS TO SEMIGROUPS
• The Sudoku completion problem with rectangular hole pattern is NP-complete

This page was built for publication: Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044937)