Heawood's empire problem

DOI10.1016/0095-8956(85)90082-6zbMath0574.05020OpenAlexW2023410066MaRDI QIDQ1062996

Gerhard Ringel, Brad Jackson

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90082-6

zbMATH Keywords

Euler characteristicchromatic numberKlein bottlem-piremethod of current graphs and cascades

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The toroidal splitting number of the complete graph \(K_ n\) ⋮ The empire problem in even embeddings on closed surfaces with \(\varepsilon\leq 0\) ⋮ The Empire Problem in Even Embeddings on Closed Surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Maps of m-pires on the projective plane
• The existence of unavoidable sets of geographically good configurations
• Every planar map is four colorable. II: Reducibility
• The splitting number of the complete graph
• Solution of Heawood's empire problem in the plane.

This page was built for publication: Heawood's empire problem