Higher-Dimensional Analogues of the Map Coloring Problem

DOI10.4169/AMER.MATH.MONTHLY.120.08.733zbMATH Open1284.05088arXiv1202.0153OpenAlexW2963156316MaRDI QIDQ5404030FDOQ5404030

Authors: Bhaskar Bagchi, Basudeb Datta 

Publication date: 20 March 2014

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Abstract: After a brief discussion of the history of the problem, we propose a generalization of the map colouring problem to higher dimensions.

Full work available at URL: https://arxiv.org/abs/1202.0153

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• On coloring box graphs
• Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
• The Other Map Coloring Theorem
• Ball packings with high chromatic numbers from strongly regular graphs

This page was built for publication: Higher-Dimensional Analogues of the Map Coloring Problem

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