A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices

DOI10.1016/j.disc.2018.12.023zbMath1405.05041OpenAlexW2911475783MaRDI QIDQ1727793

Timothy Sun

Publication date: 20 February 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.12.023

zbMATH Keywords

topological graph theorycurrent graphsmap coloring

Mathematics Subject Classification ID

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

Related Items (3)

Embeddings of a graph into a surface with different weak chromatic numbers ⋮ A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s ⋮ Simultaneous current graph constructions for minimum triangulations and complete graph embeddings

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal triangulations on orientable surfaces
• Index four orientable embeddings and case zero of the Heawood conjecture
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• The necessity of non-abelian groups in the case O of the Heawood map- coloring theorem
• The genus of K12s

This page was built for publication: A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices