Colouring Steiner quadruple systems

DOI10.1016/0166-218X(82)90068-3MaRDI QIDQ5905059zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Marlene J. Colbourn, Kevin T. Phelps, Vojtěch Rödl

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/0166-218x(82)90068-3

zbMATH Keywords

4-uniform hypergraphNP-completet designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65)

Cites work

• 2-chromatic Steiner quadruple systems
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3503283 (Why is no real title available?)
• scientific article; zbMATH DE number 3565005 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• scientific article; zbMATH DE number 3352656 (Why is no real title available?)
• scientific article; zbMATH DE number 3397560 (Why is no real title available?)
• scientific article; zbMATH DE number 3407692 (Why is no real title available?)
• Some derived Steiner triple systems

Cited in

(7)

• A class of 2-chromatic SQS(22)
• The complexity of generalized graph colorings
• Access balancing in storage systems by labeling partial Steiner systems
• Coloring Block Designs is NP-Complete
• Coloring Steiner Triple Systems
• Colourings of uniform group divisible designs and maximum packings
• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems

This page was built for publication: Colouring Steiner quadruple systems

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