The complexity of the empire colouring problem for linear forests

DOI10.1016/J.DISC.2012.06.010zbMATH Open1277.05068OpenAlexW1975603814MaRDI QIDQ385396FDOQ385396

Authors Andrew R. A. McGrae, Michele Zito 

Publication date 2 December 2013

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.06.010

zbMATH Keywords

algorithmscolouringNP-hardnessplanar graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The complexity of the empire colouring problem
• Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
• Complexity results for the empire problem in collection of stars
• Colouring Random Empire Trees
• Martingales on Trees and the Empire Chromatic Number of Random Trees

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Colouring Random Empire Trees
• Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
• Martingales on Trees and the Empire Chromatic Number of Random Trees
• Solution of Heawood's empire problem in the plane.
• Some simplified NP-complete graph problems

Cited in

(4)

• Complexity results for the empire problem in collection of stars
• Updating the complexity status of coloring graphs without a fixed induced linear forest
• Colouring Random Empire Trees
• The complexity of the empire colouring problem

This page was built for publication: The complexity of the empire colouring problem for linear forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385396)