The nonorientable genus of complete tripartite graphs

SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

Gerhard Ringel, J. W. T. Youngs · Proceedings of the National Academy of Sciences · 1968 · 332 citations · Full text

Mathematical Programming, Brain Development, Genetics +21

Map-Colour Theorem

Percy J. Heawood · Proceedings of the London Mathematical Society · 1949 · 224 citations

A Six Color Problem

Philip Franklin · Journal of Mathematics and Physics · 1934 · 72 citations

Six Color Problem, Colorization, Color Reproduction +1

Orientable and nonorientable genus of the complete bipartite graph

André Bouchet · Journal of Combinatorial Theory Series B · 1978 · 63 citations

Graph Theory, Algebraic Graph Theory, Topological Graph Theory +2

Genus embeddings for some complete tripartite graphs

Saul Stahl, Arthur T. White · Discrete Mathematics · 1976 · 49 citations

Geometric Graph Theory, Graph Theory, Structural Graph Theory +3