A simple proof of the map color theorem for nonorientable surfaces

DOI10.1016/j.jctb.2022.03.004zbMath1490.05077OpenAlexW4225614383MaRDI QIDQ2673477

Vladimir P. Korzhik

Publication date: 10 June 2022

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2022.03.004

zbMATH Keywords

complete graphtopological graphmap color theoremminimal nonorientable embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Settling the genus of the \(n\)-prism

Cites Work

• Unnamed Item
• Unnamed Item
• Dihedral biembeddings and triangulations by complete and complete tripartite graphs
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• A lower bound for the number of orientable triangular embeddings of some complete graphs
• Another proof of the map color theorem for nonorientable surfaces.
• Exponential families of non-isomorphic triangulations of complete graphs
• On biembeddings of Latin squares
• Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
• Smooth solutions in case 1 of the Heawood conjecture for non-orientable surfaces
• On the number of triangular embeddings of complete graphs and complete tripartite graphs
• Recursive constructions for triangulations
• Remarks on the Heawood conjecture (nonorientable case)
• The nonorientable genus of 𝐾_{𝑛}
• Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen

This page was built for publication: A simple proof of the map color theorem for nonorientable surfaces