The complexity of the empire colouring problem (Q476435): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C10 / 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 / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6375638 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
colouring | |||
| Property / zbMATH Keywords: colouring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graphs | |||
| Property / zbMATH Keywords: planar graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NP-hardness | |||
| Property / zbMATH Keywords: NP-hardness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph algorithms | |||
| Property / zbMATH Keywords: graph algorithms / rank | |||
Normal rank | |||
Revision as of 18:03, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the empire colouring problem |
scientific article |
Statements
The complexity of the empire colouring problem (English)
0 references
2 December 2014
0 references
colouring
0 references
planar graphs
0 references
NP-hardness
0 references
graph algorithms
0 references
