The strong chromatic number of partial triple systems

DOI10.1016/0166-218X(88)90039-XzbMath0642.05022MaRDI QIDQ1101122

Alexander Rosa, Dieter Jungnickel, Charles J. Colbourn

Publication date: 1988

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

zbMATH Keywords

algorithmhypergraphmaximal partial triple systemsstrong chromatic numbersstrong colouring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Related Items

Quadratic leaves of maximal partial triple systems ⋮ Star chromatic numbers of hypergraphs and partial Steiner triple systems ⋮ Maximal partial clones determined by the areflexive relations ⋮ Completeness theory for finite partial algebras ⋮ Partial Sheffer operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding partial Steiner triple systems is NP-complete
• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• Quadratic leaves of maximal partial triple systems
• The NP-Completeness of Edge-Coloring
• Coloring Block Designs is NP-Complete
• Coloring Steiner Triple Systems
• NP completeness of finding the chromatic index of regular graphs