Another proof of the map color theorem for nonorientable surfaces.

DOI10.1006/jctb.2002.2124zbMath1038.05018OpenAlexW2000375873MaRDI QIDQ1403919

Vladimir P. Korzhik

Publication date: 20 August 2003

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

Full work available at URL: https://doi.org/10.1006/jctb.2002.2124

zbMATH Keywords

embeddinggraph coloringgenus of graphs

Mathematics Subject Classification ID

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

Related Items

Nonorientable biembeddings of Steiner triple systems, The nonorientable genus of joins of complete graphs with large edgeless graphs, Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs, A simple proof of the map color theorem for nonorientable surfaces, Face distributions of embeddings of complete graphs, Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments

Cites Work

• Unnamed Item
• Unnamed Item
• Face 2-colourable triangular embeddings of complete graphs
• Exponential families of non-isomorphic triangulations of complete graphs
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Smooth solutions in case 1 of the Heawood conjecture for non-orientable surfaces
• Surface embeddings of Steiner triple systems
• Remarks on the Heawood conjecture (nonorientable case)
• The nonorientable genus of 𝐾_{𝑛}
• Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen