Journal ArticleOPEN ACCESS

The Flip-Graph of the 4-Dimensional Cube is Connected

Discrete and Computational Geometry (2013) 49(3) 511-530
DOI: 10.1007/s00454-013-9488-y
5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence that this vertex set has 92,487,256 triangulations, partitioned into 247,451 symmetry classes. © 2013 Springer Science+Business Media New York.

Author supplied keywords

Cite

CITATION STYLE

APA

Pournin, L. (2013). The Flip-Graph of the 4-Dimensional Cube is Connected. Discrete and Computational Geometry, 49(3), 511–530. https://doi.org/10.1007/s00454-013-9488-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free