Solution of Heawood's empire problem in the plane.
From MaRDI portal
Publication:3669439
DOI10.1515/crll.1984.347.146zbMath0519.05028OpenAlexW4236884090MaRDI QIDQ3669439
Publication date: 1984
Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)
Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002201143
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
On the bigenus of the complete graphs ⋮ The empire problem in even embeddings on closed surfaces with \(\varepsilon\leq 0\) ⋮ The complexity of the empire colouring problem for linear forests ⋮ Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs ⋮ The complexity of the empire colouring problem ⋮ On the planar split thickness of graphs ⋮ On the Bar Visibility Number of Complete Bipartite Graphs ⋮ Colouring Random Empire Trees ⋮ The splitting number of the complete graph ⋮ Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem ⋮ A short solution of Heawood's empire problem in the plane ⋮ Heawood's empire problem ⋮ The Empire Problem in Even Embeddings on Closed Surfaces
This page was built for publication: Solution of Heawood's empire problem in the plane.
