The Complexity of Near-Optimal Graph Coloring (Q4083458): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q89895272, #quickstatements; #temporary_batch_1704785786528 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q89895272 / rank | |||
Normal rank | |||
Revision as of 09:50, 9 January 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
