The complexity of the empire colouring problem (Q476435): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3103087101 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1109.2162 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Biplanar graphs: A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Thickness of the Complete Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5732335 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5421810 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Martingales on Trees and the Empire Chromatic Number of Random Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3651735 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3577833 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3684121 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution of Heawood's empire problem in the plane. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4276003 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Remarks on the thickness and outerthickness of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Colouring Random Empire Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5782525 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The thickness of graphs: A survey / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 08:41, 9 July 2024
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