Colouring graphs when the number of colours is nearly the maximum degree (Q5176002): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Michael S. O. Molloy / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Bruce A. Reed / rank | |||
Normal rank | |||
Revision as of 01:11, 11 February 2024
scientific article; zbMATH DE number 6409743
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
