Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-14T10:25:58.710Z Has data issue: false hasContentIssue false

Regular Partitions of Regular Graphs

Published online by Cambridge University Press:  20 November 2018

Peter Kleinschmidt*
Affiliation:
Mathematisches Institut Der, Ruhr-Universitat, 4630 Bochum. West Germany
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 the study of the combinatorial structure of edge-graphs of convex polytopes one may ask whether a given graph possesses a partition consisting of certain kinds of subgraphs.

In this paper we describe some special partitions of 3-valent and 4-valent graphs. These partitions can serve as examples for a type of partially ordered structures, called polystromas, which have recently been considered by Griinbaum [3].

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1978