A short solution of Heawood's empire problem in the plane

DOI10.1016/S0012-365X(98)00110-1zbMath0955.05046MaRDI QIDQ1584437

Walter Wessel

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

colouringmapcomplete multimapsHeawood's empire problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs ⋮ On the Bar Visibility Number of Complete Bipartite Graphs ⋮ Colouring Random Empire Trees

Cites Work

• Parallel concepts in graph theory
• Solution of Heawood's empire problem in the plane.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A short solution of Heawood's empire problem in the plane