Colouring Steiner quadruple systems

DOI10.1016/0166-218X(82)90068-3zbMath0482.05020OpenAlexW2086263145MaRDI QIDQ5905059

Charles J. Colbourn, Kevin T. Phelps, Marlene J. Colbourn, 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

NP-complete4-uniform hypergrapht designs

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• 2-chromatic Steiner quadruple systems
• Some derived Steiner triple systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item