Index 3 biembeddings of the complete graphs
From MaRDI portal
Publication:6080145
Abstract: We show that the complete graphs on vertices have decompositions into two edge-disjoint subgraphs, each of which triangulates an orientable surface. The special case where the two surfaces are homeomorphic solves a generalized Earth-Moon problem for that surface. Unlike previous constructions, these pairs of triangular embeddings are derived from index 3 current graphs.
Recommendations
- On the bigenus of the complete graphs
- A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
Cites work
- scientific article; zbMATH DE number 3144962 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- Biplanar graphs: A survey
- Current graphs and bi-embeddings
- Die toroidale Dicke des vollständigen Graphen
- Every planar graph with nine points has a nonplanar complement
- Infinite families of bi-embeddings
- Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
- Minimal triangulations on orientable surfaces
- On the bigenus of the complete graphs
- Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
- Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9
- The Non-Biplanar Character of the Complete 9-Graph
- To the Moon and Beyond
- Variations on Ringel's earth-moon problem
This page was built for publication: Index 3 biembeddings of the complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080145)