| Autor: |
Hartsfield, Nora, Ringel, Gerhard |
| Zdroj: |
Combinatorica; Jun1991, Vol. 11 Issue 2, p145-155, 11p |
| Abstrakt: |
A polyhedron on a surface is called a clean triangulation if each face is a triangle and each triangle is a face. Let S (resp. N) be the closed orientable (resp. nonorlentable) surface of genus p. If τ( S) is the smallest possible number of triangles in a clean triangulation of S, the results are: τ( N)=20, τ( S)=24, limτ (S) p=4, limτ (N) p=2 for p→∞. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink