Clean triangulations

DOI10.1007/BF01206358MaRDI QIDQ1180415zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Nora Hartsfield, Gerhard Ringel

Publication date 27 June 1992

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01206358

zbMATH Keywords

clean triangulation

Mathematics Subject Classification ID

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

Review text

A surface \(S\) is a closed 2-manifold, either orientable \((S_p\), of genus \(p\geq 0)\) or nonorientable \((N_p\), of genus \(p>0\)). A clean triangulation of \(S\) is a 2-cell imbedding of a graph \(G\) into \(S\) having every 2-cell bounded by a 3-cycle of \(G\) and having every 3-cycle of \(G\) bound a 2-cell. Then \(\tau(S)\) denotes the smallest possible number of triangles in a clean triangulation of \(S\). For example, the tetrahedron shows that \(\tau(S_0)=4\). (The imbedding of \(K_3\) into \(S_0\) is not considered, as it does not correspond to a polyhedron.) The new results are: \(\tau(S_1)=24\), \(\tau(N_1)=20\), and (for \(p\to\infty)\) \(\lim \tau(S_p)/p=4\), \(\lim \tau(N_p)/p=2\). Thus \(\tau(S)\) has the same asymptotic behavior as \(\delta(S)\) (the smallest number of triangles in a (not necessarily clean) triangulation of \(S\)); see \textit{M. Jungerman} and the second author [Acta Math. 145, 121--154 (1980; Zbl 0451.57005)] and the second author [Math. Ann. 130, 317--326 (1955; Zbl 0066.41702)].

Recommendations

• All orientable 2-manifolds have finitely many minimal triangulations
• Decomposition and Enumeration of Triangulated Surfaces
• Triangulations on closed surfaces which quadrangulate other surfaces. II.
• scientific article; zbMATH DE number 475596

Cites work

• A Census of Planar Triangulations
• Das Geschlecht des vollständigen paaren Graphen
• Map-Colour Theorems
• Minimal triangulations on orientable surfaces
• Short Proof of a Map-Colour Theorem
• Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann

Cited in

(10)

• Counting 1-vertex triangulations of oriented surfaces
• Triangulations intersect nicely
• Uniform strong 2-cell embeddings of bridgeless graphs
• The covering type of closed surfaces and minimal triangulations
• scientific article; zbMATH DE number 21750 (Why is no real title available?)
• scientific article; zbMATH DE number 64357 (Why is no real title available?)
• Large random simplicial complexes. II: The fundamental group
• Topology of random 2-complexes
• Generating locally-cyclic triangulations of surfaces
• Densely embedded graphs

This page was built for publication: Clean triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180415)