MAX <i>k</i>‐CUT and approximating the chromatic number of random graphs (Q5471049)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: MAX k‐CUT and approximating the chromatic number of random graphs |
scientific article; zbMATH DE number 5029905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | MAX <i>k</i>‐CUT and approximating the chromatic number of random graphs |
scientific article; zbMATH DE number 5029905 |
Statements
MAX <i>k</i>‐CUT and approximating the chromatic number of random graphs (English)
0 references
6 June 2006
0 references
0 references
0 references
