On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems |
scientific article |
Statements
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (English)
0 references
1984
0 references
algorithmic complexity
0 references
hypergraph coloring
0 references
Steiner systems
0 references
0 references
0 references
