The Complexity of Near-Optimal Graph Coloring (Q4083458)
From MaRDI portal
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
