High Quality Content by WIKIPEDIA articles! In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is, every convex polyhedron forms a 3-connected planar graph, and every 3-connected planar graph can be represented as the graph of a convex polyhedron. For this reason, the 3-connected planar graphs are also known as polyhedral graphs. Steinitz's theorem is named after Ernst Steinitz, who proved it in 1922. Branko Grunbaum has called this theorem “the most important and deepest known result on 3-polytopes.”

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.