Simultaneous current graph constructions for minimum triangulations and complete graph embeddings

DOI10.26493/1855-3974.2006.fa4zbMath1464.05131arXiv1902.00152OpenAlexW3015659686MaRDI QIDQ4988855

Timothy Sun

Publication date: 19 May 2021

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.00152

zbMATH Keywords

triangulationstopological graph theorycurrent graphsmap coloring

Mathematics Subject Classification ID

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

Related Items (2)

Index 3 biembeddings of the complete graphs ⋮ Settling the genus of the \(n\)-prism

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal triangulations on orientable surfaces
• Orientable and non orientable genus of the complete bipartite graph
• A minimum-vertex triangulation
• The genus of \(K_n-K_2\)
• Index four orientable embeddings and case zero of the Heawood conjecture
• Triangular imbedding of \(K_n-K_6\)
• Orientable triangular embeddings of K\(_{18}\)-K\(_3\) and K\(_{13}\)-K\(_3\)
• A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Triangular embeddings of complete graphs from graceful labellings of paths
• Über das Problem der Nachbargebiete auf orientierbaren Flächen
• A smooth and unified proof of cases 6, 5 and 3 of the Ringel-Youngs theorem
• The genus of the n‐octahedron: Regular cases
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Solution of the Heawood map-coloring problem—case 11
• Le problème des régions voisines sur les surfaces closes orientables
• Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9
• Orientable embedding of Cayley graphs

This page was built for publication: Simultaneous current graph constructions for minimum triangulations and complete graph embeddings