Work

A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs

Year: 1974
Type: article
Abstract: In this paper we derive a generation procedure for the simple (3-valent) 3-polytopes with cyclically 5-connected graphs. (A graph is called cyclically n-connected if it cannot be broken into two components, each containing a cycle, by the removal of fewer than n edges.) We define three new types of face splitting and we show, in Theorems 16 and 17, that the simple 3-polytopes with cyclically 5-connected graphs are exactly the polytopes obtained from the dodecahedron by these face splittings.
Institution: McGill University
Language: English
Open Access status: bronze
OpenAlex ID: W2005124615
FWCI: 0.458
Cites: 4
Cited by: 30
Related to: 10