Minimal triangulations on orientable surfaces
From MaRDI portal
Publication:1148032
DOI10.1007/BF02414187zbMath0451.57005WikidataQ56455836 ScholiaQ56455836MaRDI QIDQ1148032
Gerhard Ringel, Mark Jungerman
Publication date: 1980
Published in: Acta Mathematica (Search for Journal in Brave)
05C10: Planar graphs; geometric and topological aspects of graph theory
57M15: Relations of low-dimensional topology with graph theory
Related Items
Stacked polytopes and tight triangulations of manifolds, Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers, Enriched homology and cohomology modules of simplicial complexes, Densely embedded graphs, Socles of Buchsbaum modules, complexes and posets, Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds, Nonexistence of weakly neighborly polyhedral maps on the orientable 2- manifold of genus 2, Minimal quadrangulations of orientable surfaces, Minimal quadrangulations of nonorientable surfaces, Clean triangulations, Diagonal flips in triangulations of surfaces, Constructing the graphs that triangulate both the torus and the Klein bottle, Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\), Enumerative properties of triangulations of spherical bundles over \(S^1\), Degree-regular triangulations of torus and Klein bottle, The nonorientable genus of joins of complete graphs with large edgeless graphs, Degree-regular triangulations of the double-torus, A maximally symmetric polyhedron of genus 3 with 10 vertices
Cites Work
- Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
- A minimum-vertex triangulation
- The genus of \(K_n-K_2\)
- Triangular imbedding of \(K_n-K_6\)
- Orientable triangular embeddings of K\(_{18}\)-K\(_3\) and K\(_{13}\)-K\(_3\)
- Lösung des Problems der Nachbargebiete
- Über das Problem der Nachbargebiete auf orientierbaren Flächen
- The genus of the n‐octahedron: Regular cases
- The genus of K12s
- Solution of the Heawood map-coloring problem—case 11
- The heawood map-coloring problem—Cases 1, 7, and 10
- Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9
- Orientable embedding of Cayley graphs