 The Schlegel diagram of a convex polyhedron represents its vertices and edges as points and line segments in the Euclidean plane, forming a subdivision of an outer convex polygon into smaller convex polygons.It has no crossings, so every polyhedral graph is also a planar graph.Additionally, by Balinski's theorem, it is a 3-vertex-connected graph.