We show that neither the 3-ball nor the solid torus admits a triangulation in which (i) every vertex is on the boundary, and (ii) every tetrahedron has exactly one triangle on the boundary. Such triangulations are relevant to an unresolved conjecture of Perles.
Dwarf, brick, and triangulation of the torus
✍ Scribed by Hans-Jürgen Bandelt; Elke Wilkeit
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 789 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We show how to construct all the graphs that can be embedded on both the torus and the Klein bottle as their triangulations.
A graph of a triangulation of the toms is said to be uniquely embeddable in the torus provided all its embeddings are isomorphic as triangulations. An infinite set of toms triangulations of connectivity 5 has been constructed, with graphs that are not uniquely embeddable in the torus.
The triangulations of the torus can be generated from a set of 21 minimal triangulations by vertex splitting. We show that if we never create a 3-valent vertex when we split them we generate the 4-connected triangulations. In addition if we never create two adjacent 4-valent vertexes then we gener