Octahedralizing 3-Colorable 3-Polytopes

Autor(en): Codenotti, Giulia
Venturello, Lorenzo
Stichwörter: 3-Colorable 3-polytopes; Computer Science; Computer Science, Theory & Methods; Cross-polytopal complex; Cross-polytope; Mathematics; Polytopal subdivisions
Erscheinungsdatum: 2021
Herausgeber: SPRINGER
Journal: DISCRETE & COMPUTATIONAL GEOMETRY
Volumen: 66
Ausgabe: 4
Startseite: 1429
Seitenende: 1445
Zusammenfassung: 
We investigate the question of whether any d-colorable simplicial d-polytope can be octahedralized, i.e., can be subdivided to a d-dimensional geometric cross-polytopal complex. We give a positive answer in dimension 3, with the additional property that the octahedralization introduces no new vertices on the boundary of the polytope.
ISSN: 01795376
DOI: 10.1007/s00454-020-00262-4

Show full item record

Google ScholarTM

Check

Altmetric