Generating the centrally symmetric 3-polyhedral graphs (Q1915141): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01858449 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965667504 / rank | |||
Normal rank | |||
Latest revision as of 10:05, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating the centrally symmetric 3-polyhedral graphs |
scientific article |
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
