Graphs of polyhedra; polyhedra as graphs (Q864132): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56047069, #quickstatements; #temporary_batch_1712261475387 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56047069 / rank | |||
Normal rank |
Revision as of 21:28, 4 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graphs of polyhedra; polyhedra as graphs |
scientific article |
Statements
Graphs of polyhedra; polyhedra as graphs (English)
0 references
13 February 2007
0 references
The article studies relationships between graphs and polyhedra in two contexts. In the first, Steinitz's Theorem about convex polyhedra is revisited and the one-to-one correspondence between convex polyhedra and 3-connected planar graphs is described in detail. In the second, graphs are employed to define and study abstract and geometric polyhedra, with the goal to provide a rigorous approach to the theory of nonconvex polyhedra. Included are detailed comments about the history of the theory of polyhedra.
0 references
polygon
0 references
3-connected planar graphs
0 references
Steinitz's Theorem
0 references
convex polyhedron
0 references
nonconvex polyhedron
0 references
abstract polyhedron
0 references