Colouring graphs when the number of colours is almost the maximum degree (Q462929)
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: Colouring graphs when the number of colours is almost the maximum degree |
scientific article; zbMATH DE number 6359847
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring graphs when the number of colours is almost the maximum degree |
scientific article; zbMATH DE number 6359847 |
Statements
Colouring graphs when the number of colours is almost the maximum degree (English)
0 references
22 October 2014
0 references
chromatic number
0 references
Brooks' theorem
0 references
0 references
0 references
0.8782821297645569
0 references
0.8391936421394348
0 references
0.8294919729232788
0 references
0.8276169896125793
0 references
