Some Colouring Problems and their Complexity (Q3968953): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-0208(08)73557-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1476248438 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some Colouring Problems and their Complexity |
scientific article |
Statements
Some Colouring Problems and their Complexity (English)
0 references
1982
0 references
Turing machine
0 references
chromatic polynomial
0 references
graph-theoretic complexity problems
0 references
