Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
From MaRDI portal
Abstract: The problems of the genus of the complete graphs and minimum triangulations for each surface were both solved using the theory of current graphs, and each of them divided into twelve different cases, depending on the residue modulo 12 of the number of vertices. Cases 8 and 11 were of particular difficulty for both problems, with multiple families of current graphs developed to solve these cases. We solve these cases in a unified manner with families of current graphs applicable to both problems. Additionally, we give new constructions to both problems for Cases 6 and 9, which greatly simplify previous constructions by Ringel, Youngs, Guy, and Jungerman. All these new constructions are index 3 current graphs sharing nearly all of the structure of the simple solution for Case 5 of the Map Color Theorem.
Recommendations
- Minimum genus embeddings of the complete graph
- A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
- Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
Cites work
- A minimum-vertex triangulation
- A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
- A smooth and unified proof of cases 6, 5 and 3 of the Ringel-Youngs theorem
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- Index four orientable embeddings and case zero of the Heawood conjecture
- Le problème des régions voisines sur les surfaces closes orientables
- Minimal triangulations on orientable surfaces
- Orientable and non orientable genus of the complete bipartite graph
- Orientable embedding of Cayley graphs
- Orientable triangular embeddings of K\(_{18}\)-K\(_3\) and K\(_{13}\)-K\(_3\)
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Solution of the Heawood map-coloring problem—case 11
- Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9
- The genus of \(K_n-K_2\)
- The genus of the n‐octahedron: Regular cases
- Triangular embeddings of complete graphs from graceful labellings of paths
- Triangular imbedding of \(K_n-K_6\)
- Über das Problem der Nachbargebiete auf orientierbaren Flächen
Cited in
(7)- On the connectivity of graphs embedded in surfaces
- Settling the genus of the n-prism
- Total embedding distributions of Ringel ladders
- Index 3 biembeddings of the complete graphs
- Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
- Face sizes and the connectivity of the dual
- An optimal construction for complete graph embeddings with duals of low connectivity
This page was built for publication: Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988855)
