Generating the centrally symmetric 3-polyhedral graphs (Q1915141)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generating the centrally symmetric 3-polyhedral graphs |
scientific article; zbMATH DE number 887174
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating the centrally symmetric 3-polyhedral graphs |
scientific article; zbMATH DE number 887174 |
Statements
Generating the centrally symmetric 3-polyhedral graphs (English)
0 references
11 June 1996
0 references
Every centrally symmetric, 3-connected, planar graph can be constructed from the cube or the octahedron by applying pairs of symmetric face splittings.
0 references
polyhedral graph
0 references
planar graph
0 references
0 references
0 references
0.8463257
0 references
0.8423359
0 references
0.8420469
0 references
0.8411814
0 references
0 references
0.84040636
0 references
