The complexity of changing colourings with bounded maximum degree (Q407523): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074631242 / rank | |||
Normal rank | |||
Revision as of 22:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of changing colourings with bounded maximum degree |
scientific article |
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
