Abstract
A polyhedron on a surface is called a clean triangulation if each face is a triangle and each triangle is a face. LetS p (resp.N p ) be the closed orientable (resp. nonorlentable) surface of genusp. If τ(S) is the smallest possible number of triangles in a clean triangulation ofS, the results are: τ(N 1)=20, τ(S 1)=24, limτ(S p )p −1=4, limτ(N p )p −1=2 forp→∞.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. A. Dirac: Map colour theorems.Canad. J. Math. 4 (1952), 480–490.
G. A. Dirac: Short proof of a map colour theorem.Canad. J. Math. 9 (1957), 225–226.
J. Edmonds: A combinatorial representation for polyhedral surfaces (abstract).Notices Amer. Math. Soc. 7 (1960), 646.
M. Jungerman, andG. Ringel, Minimum triangulations on orientable surfaces.Acta Math. 145 (1980), 121–154.
G. Ringel: Das Geschlecht des vollständigen paaren Graphen.Abh. Math. Sem. Univ. Hamburg. 28 (1965), 139–150.
G. Ringel: Wie man die geschlossenen nichtorientierbaren Flächen in mőglichst wenig Dreiecke zerlegen kann.Math. Ann. 130 (1955), 317–326.
W. T. Tutte: A census of plane triangulations,Canad. J. Math. 14 (1962), 21–28.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hartsfield, N., Ringel, G. Clean triangulations. Combinatorica 11, 145–155 (1991). https://doi.org/10.1007/BF01206358
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01206358