| Information | |
|---|---|
| has gloss | eng: In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron. According to Steinitz's theorem, the polyhedral graphs may also be characterized in purely graph-theoretic terms, as the 3-vertex-connected planar graphs. |
| lexicalization | eng: polyhedral graph |
| instance of | c/Geometric graphs |
| Media | |
|---|---|
| media:img | Dodecahedron schlegel diagram.png |
Lexvo © 2008-2026 Gerard de Melo. Contact Legal Information / Imprint
