On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02579160 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049432567 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 30 July 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
0 references
0 references
