Some NP-completeness results on partial Steiner triple systems and parallel classes.

zbMATH Open1224.05056MaRDI QIDQ3428664FDOQ3428664

Authors: Michel Toulouse, P. C. Li 

Publication date: 29 March 2007

Recommendations

• Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete
• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• scientific article; zbMATH DE number 3961623
• The strong chromatic number of partial triple systems
• On partial parallel classes in partial Steiner triple systems

zbMATH Keywords

chromatic indexparallel classpartial Steiner triple systemresolution class

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Triple systems (05B07)

Cited In (2)

• Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete
• Title not available (Why is that?)

This page was built for publication: Some \(NP\)-completeness results on partial Steiner triple systems and parallel classes.

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