Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T02:57:44.490Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  20 November 2018

Jean W. Butler*
Affiliation:
McGill University, Montreal, Quebec
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1974