Andere Kunden interessierten sich auch für
![Ostrowski's Theorem]( "Ostrowski's Theorem")
Ostrowski's Theorem25,99 €![Nagell Lutz Theorem]( "Nagell Lutz Theorem")
Nagell Lutz Theorem29,99 €![Szpilrajn Extension Theorem]( "Szpilrajn Extension Theorem")
Szpilrajn Extension Theorem19,99 €![Pizza Theorem]( "Pizza Theorem")
Pizza Theorem22,99 €![Open Mapping Theorem (Complex Analysis)]( "Open Mapping Theorem (Complex Analysis)")
Open Mapping Theorem (Complex Analysis)22,99 €![Riemann Roch Theorem]( "Riemann Roch Theorem")
Riemann Roch Theorem22,99 €![Symmetric Hypergraph Theorem]( "Symmetric Hypergraph Theorem")
Symmetric Hypergraph Theorem29,99 €
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 Grünbaum has called this theorem the most important and deepest known result on 3-polytopes.