Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon

DOI10.2307/2690733zbMath0804.05037OpenAlexW4256453260MaRDI QIDQ4306099

Joan P. Hutchinson

Publication date: 9 January 1995

Full work available at URL: https://doi.org/10.2307/2690733

zbMATH Keywords

mapsthicknesschromatic numbercolorsclosed surfaces\(M\)-piresHeawood's upper boundplanar coloring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Rectangle-visibility representations of bipartite graphs ⋮ A tribute to Frank Harary (in honor of his 70th birthday) ⋮ Area, perimeter, height, and width of rectangle visibility graphs ⋮ The complexity of the empire colouring problem ⋮ On the planar split thickness of graphs ⋮ The thickness and chromatic number of \(r\)-inflated graphs ⋮ Colouring Random Empire Trees ⋮ Defective and clustered choosability of sparse graphs ⋮ Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem ⋮ Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs

This page was built for publication: Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon