## Is every 1-skeleton of a 4-tope Steinitzian?

Call a graph “polyhedral” if it is simple, planar, and 3-connected. For example, the 1-dimensional skeleton of every 3-dimensional convex polytope, regarded as a graph, is polyhedral. By a theoreom of Steinitz, polyhedral graphs are exactly the graphs which appear as 1-skeleta of 3-dimensional convex polytopes. Call a graph “Steinitzian” if it has a spanning … Read more