The complexity of changing colourings with bounded maximum degree (Q407523): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6018468 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial problems | |||
Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational complexity | |||
Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph algorithms | |||
Property / zbMATH Keywords: graph algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(k\)-colouring | |||
Property / zbMATH Keywords: \(k\)-colouring / rank | |||
Normal rank |
Revision as of 18:49, 29 June 2023
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