bn:01244598n
Noun Named Entity
Categories: Theorems in graph theory, Planar graphs, Geometric graph theory, Polyhedral combinatorics, Theorems in discrete geometry
EN
Steinitz's theorem  Steinitz Theorem  Skeletal regular polyhedra  Skeletal regular polyhedron  Steinitz' theorem
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
Characterizes graphs formed by edges and vertices of 3-dimensional convex polyhedra Wikidata
IS A
NAMED AFTER