Reconstructing a non-simple polytope from its graph (Q4518987)

Let \(P\) be an arbitrary polytope and \(\Gamma_P\) its vertex-edge graph. For each vertex \(v\) of \(P\), let \(\eta_v\) be the map from the set \({\mathcal F}(v)\) of facets containing \(v\) to the set of subsets of the set \(\Gamma(P)(v)\) of edges through \(v\), such that each facet \(F\) is mapped onto the set of edges through \(v\) which are contained in \(F\). We call the family of images \(\{\eta_v({\mathcal F}(v))\mid v\) vertex of \(P\}\) the edge labelled vertex figures of \(P\). The author proves that a polytope can be reconstructed from its graph and its edge labelled vertex figure. Then a conjuecture is stated: Every cubical polytope can be reconstructed from its dual graph. The author proves that conjecture for a family of cubical polytopes, namely the capped cubical polytopes. For the entire collection see [Zbl 0944.00089].