On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs (Q4256092)
From MaRDI portal
scientific article; zbMATH DE number 1309111
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs |
scientific article; zbMATH DE number 1309111 |
Statements
9 January 2000
0 references
nibble method
0 references
chromatic number
0 references
choice number
0 references
polynomial coloring algorithm
0 references
random graphs
0 references
hypergraphs
0 references
locally sparse graphs
0 references
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs (English)
0 references
