A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
1974 ◽
Vol 26
(3)
◽
pp. 686-708
◽
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.
Keyword(s):
Keyword(s):