The Complexity of Near-Optimal Graph Coloring (Q4083458): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q89895272, #quickstatements; #temporary_batch_1704785786528 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:57, 6 February 2024
scientific article; zbMATH DE number 3503280
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Near-Optimal Graph Coloring |
scientific article; zbMATH DE number 3503280 |
Statements
The Complexity of Near-Optimal Graph Coloring (English)
0 references
1976
0 references
