The complexity of the empire colouring problem for linear forests

DOI10.1016/J.DISC.2012.06.010zbMath1277.05068OpenAlexW1975603814MaRDI QIDQ385396

Michele Zito, Andrew R. A. McGrae

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

algorithmscolouringplanar graphsNP-hardness

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Some simplified NP-complete graph problems
• Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
• Martingales on Trees and the Empire Chromatic Number of Random Trees
• Colouring Random Empire Trees
• Solution of Heawood's empire problem in the plane.

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