Intersecting all edges of convex polytopes by planes

A characterization theorem is given for 3-dimensional convex polytopes Q having the following property: There exists a polytope P, isomorphic to Q, all edges of which can be cut by a pair of planes that miss all its vertices. The result yields an affirmative solution of a conjecture of B. Grünbaum.