Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
From MaRDI portal
Publication:4306099
DOI10.2307/2690733zbMath0804.05037MaRDI QIDQ4306099
Publication date: 9 January 1995
Full work available at URL: https://doi.org/10.2307/2690733
maps; thickness; chromatic number; colors; closed surfaces; \(M\)-pires; Heawood's upper bound; planar coloring problem
05C15: Coloring of graphs and hypergraphs
Related Items
Defective and clustered choosability of sparse graphs, Area, perimeter, height, and width of rectangle visibility graphs, The complexity of the empire colouring problem, The thickness and chromatic number of \(r\)-inflated graphs, Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs, Rectangle-visibility representations of bipartite graphs, A tribute to Frank Harary (in honor of his 70th birthday), On the planar split thickness of graphs, Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem, Colouring Random Empire Trees