Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen

DOI10.1007/BF01361120zbMath0055.17001MaRDI QIDQ5972204

Gerhard Ringel

Publication date: 1954

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/160372

zbMATH Keywords

topology

Related Items

The choice number versus the chromatic number for graphs embeddable on orientable surfaces ⋮ Three nonisomorphic triangulations of an orientable surface with the same complete graph ⋮ The nonorientable genus of joins of complete graphs with large edgeless graphs ⋮ A simple proof of the map color theorem for nonorientable surfaces ⋮ Another proof of the map color theorem for nonorientable surfaces. ⋮ Dirac's map-color theorem for choosability ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ The topological theory of current graphs ⋮ Coloring face hypergraphs on surfaces ⋮ A new solution for the nonorientable case 1 of the Heawood map color theorem ⋮ Tight polyhedral Klein bottles, projective planes, and Möbius bands ⋮ The nonorientable genus of complete tripartite graphs ⋮ The genus of nearly complete graphs-case 6 ⋮ New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces ⋮ Lösung des Problems der Nachbargebiete ⋮ Über das Problem der Nachbargebiete auf orientierbaren Flächen ⋮ On the connectivity of graphs embedded in surfaces ⋮ Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann ⋮ Realizing the chromatic numbers of triangulations of surfaces ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs

Cites Work

• The map-coloring of unorientable surfaces
• Map-Colour Theorems
• Farbensatz für nichtorientierbare Flächen beliebigen Geschlechtes.

This page was built for publication: Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen