Colouring graphs when the number of colours is nearly the maximum degree (Q5176002)
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 nearly the maximum degree |
scientific article; zbMATH DE number 6409743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring graphs when the number of colours is nearly the maximum degree |
scientific article; zbMATH DE number 6409743 |
Statements
Colouring graphs when the number of colours is nearly the maximum degree (English)
0 references
27 February 2015
0 references
graph colouring
0 references
probabilistic methods
0 references
0.8782821297645569
0 references
0.8164941072463989
0 references
0.8102399110794067
0 references
0.8026365041732788
0 references
