## Reconstructing Nearly Simple Polytopes from their Graph

*Doolittle, Joseph*;

- Subject: Mathematics - Combinatorics | 52Bxxarxiv: Mathematics::Metric Geometry | Mathematics::Combinatorics

We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In particular, we introduce a no... View more

Share - Bookmark

- Download from