Star chromatic numbers of hypergraphs and partial Steiner triple systems
From MaRDI portal
Publication:1903717
DOI10.1016/0012-365X(94)00156-1zbMath0845.05016MaRDI QIDQ1903717
Publication date: 26 August 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Cites Work
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
- On the complexity of H-coloring
- The strong chromatic number of partial triple systems
- A note on the star chromatic number
- Star chromatic number
- Coloring Steiner Triple Systems
- On chromatic number of graphs and set-systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item