Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-25T02:53:04.786Z Has data issue: false hasContentIssue false
  • English
  • Français

Regular Partitions of Regular Graphs

Published online by Cambridge University Press:  20 November 2018

Peter Kleinschmidt
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].

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 21 , Issue 2 , 01 June 1978 , pp. 177 - 181
Copyright
Copyright © Canadian Mathematical Society 1978

References

1. Beineke-Plummer, , On the I-factors of a non-separable graph, J. Combinatorial Theory 2 (1967), 285-289.Google Scholar
2. Grünbaum, B., Convex Poly topes, New York 1967.Google Scholar
3. Grünbaum, B., Regularity of graphs, complexes and designs, to appear.Google Scholar
4. König, D., Theorie der endlichen und unendlichen Graphen, New York 1950.Google Scholar
5. Mader, W., Über die Anzahl der von den 1-Faktoren eines Graphen uberdeckten Ecken, Math. Nachr. 56 (1973), 195-200.Google Scholar
6. Mader, W., 1-Faktoren von Graphen, Math. Ann. 201 (1973), 269-282.Google Scholar
7. Tait, P. G., Some elementary properties of closed plane curves, Messenger Math. (2) 6 (1877), 132-133.Google Scholar
8. Zaks, J., On the l-factors of n-connected graphs, J. Combinatorial Theory B (1971), 169-181.Google Scholar