Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs)
It is a well known fact that a simple convex d-polytope is uniquely determined by its 2-skeleton. An old conjecture of M. A. Perles says that it is already uniquely determined by its graph. Here it is proved that the conjecture is true if the 2-faces of the polytope have at most 6 edges.
scientific article; zbMATH DE number 4019883