The complexity of changing colourings with bounded maximum degree (Q407523)
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: The complexity of changing colourings with bounded maximum degree |
scientific article; zbMATH DE number 6018468
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of changing colourings with bounded maximum degree |
scientific article; zbMATH DE number 6018468 |
Statements
The complexity of changing colourings with bounded maximum degree (English)
0 references
27 March 2012
0 references
combinatorial problems
0 references
computational complexity
0 references
graph algorithms
0 references
\(k\)-colouring
0 references
0.9047437
0 references
0 references
0 references
0.8929305
0 references
0.8900053
0 references
0.8876587
0 references
0.8866284
0 references
0.88442075
0 references
0.8833009
0 references
0 references
