Minimal triangulations on orientable surfaces

DOI10.1007/BF02414187zbMath0451.57005WikidataQ56455836 ScholiaQ56455836MaRDI QIDQ1148032

Gerhard Ringel, Mark Jungerman

Publication date: 1980

Published in: Acta Mathematica (Search for Journal in Brave)

zbMATH Keywords

minimal triangulations for orientable 2-manifolds

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items

Minimal triangulations of two-dimensional manifolds ⋮ Diagonal flips in triangulations of surfaces ⋮ Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers ⋮ Irreducible triangulations of surfaces with boundary ⋮ The nonorientable genus of joins of complete graphs with large edgeless graphs ⋮ Balanced Manifolds and Pseudomanifolds ⋮ Triangulating surfaces with bounded energy ⋮ Minimal quadrangulations of orientable surfaces ⋮ Minimal quadrangulations of nonorientable surfaces ⋮ Non-existence of polyhedral immersions of triangulated surfaces in \(\mathbb R^3\) ⋮ Minimal quadrangulations of surfaces ⋮ \(F\)-matrices of cluster algebras from triangulated surfaces ⋮ On local combinatorial formulas for Chern classes of a triangulated circle bundle ⋮ Enriched homology and cohomology modules of simplicial complexes ⋮ Locally Hamiltonian graphs and minimal size of maximal graphs on a surface ⋮ Edge‐maximal graphs on orientable and some nonorientable surfaces ⋮ Index 3 biembeddings of the complete graphs ⋮ The phase structure and effective action of 3D CDT at higher spatial genus ⋮ A maximally symmetric polyhedron of genus 3 with 10 vertices ⋮ Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs ⋮ Enumerative properties of triangulations of spherical bundles over \(S^1\) ⋮ A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\) ⋮ Minimal Delaunay triangulations of hyperbolic surfaces ⋮ Generalized Heawood numbers ⋮ Face numbers: the upper bound side of the story ⋮ Densely embedded graphs ⋮ A Construction Principle for Tight and Minimal Triangulations of Manifolds ⋮ On the maximum number of cliques in a graph embedded in a surface ⋮ A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices ⋮ Clean triangulations ⋮ Topology of random 2-complexes ⋮ Vertex-transitive polyhedra of higher genus. I ⋮ The covering type of closed surfaces and minimal triangulations ⋮ ON THE GENUS OF THE INTERSECTION GRAPH OF IDEALS OF A COMMUTATIVE RING ⋮ Stacked polytopes and tight triangulations of manifolds ⋮ Systolic geometry and simplicial complexity for groups ⋮ Topics of Stochastic Algebraic Topology ⋮ The Roger-Yang skein algebra and the decorated Teichmüller space ⋮ Simplicial complexity of surface groups ⋮ Constructing the graphs that triangulate both the torus and the Klein bottle ⋮ Socles of Buchsbaum modules, complexes and posets ⋮ Simultaneous current graph constructions for minimum triangulations and complete graph embeddings ⋮ Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds ⋮ Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\) ⋮ Degree-regular triangulations of torus and Klein bottle ⋮ Degree-regular triangulations of the double-torus ⋮ Simplicial complexes from finite projective planes and colored configurations ⋮ Nonexistence of weakly neighborly polyhedral maps on the orientable 2- manifold of genus 2

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

This page was built for publication: Minimal triangulations on orientable surfaces