DOI: 10.1007/BF01830678 URL: http://link.springer.com/10.1007/BF01830678 Authors: Roswitha Blind, Peter Mani-Levitska Journal/publisher: Year: 1987
Title: Puzzles and polytope isomorphisms
Abstract: We show that an isomorphism between the graphs of two simple polytopes of arbitrary dimension can always be extended to an isomorphism between the polytopes themselves. It has been convenient to study the dual situation, involving what we like to call the puzzle of a simplicial polytope.