Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01244598n
Noun Named Entity
AR
No term available
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
Relations
Sources
IS A
مبرهنة
NAMED AFTER
Ernst Steinitz

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License