On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs (Q4256092): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199907)31:3<201::aid-jgt5>3.0.co;2-t / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4249811006 / rank | |||
Normal rank | |||
| Property / title | |||
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs (English) | |||
| Property / title: On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 08:22, 30 July 2024
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
