On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:14, 5 March 2024
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
