Geodesic
Regular Partitions of Regular Graphs
Canadian mathematical bulletin, Tome 21 (1978) no. 2, pp. 177-181

Voir la notice de l'article provenant de la source Cambridge University Press

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]. 
Kleinschmidt, Peter. Regular Partitions of Regular Graphs. Canadian mathematical bulletin, Tome 21 (1978) no. 2, pp. 177-181. doi: 10.4153/CMB-1978-030-4
@article{10_4153_CMB_1978_030_4,
     author = {Kleinschmidt, Peter},
     title = {Regular {Partitions} of {Regular} {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {177--181},
     year = {1978},
     volume = {21},
     number = {2},
     doi = {10.4153/CMB-1978-030-4},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-030-4/}
}
TY  - JOUR
AU  - Kleinschmidt, Peter
TI  - Regular Partitions of Regular Graphs
JO  - Canadian mathematical bulletin
PY  - 1978
SP  - 177
EP  - 181
VL  - 21
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-030-4/
DO  - 10.4153/CMB-1978-030-4
ID  - 10_4153_CMB_1978_030_4
ER  - 
%0 Journal Article
%A Kleinschmidt, Peter
%T Regular Partitions of Regular Graphs
%J Canadian mathematical bulletin
%D 1978
%P 177-181
%V 21
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-030-4/
%R 10.4153/CMB-1978-030-4
%F 10_4153_CMB_1978_030_4

[1] 1. Beineke-Plummer, , On the I-factors of a non-separable graph, J. Combinatorial Theory 2 (1967), 285-289. Google Scholar

[2] 2. Grünbaum, B., Convex Poly topes, New York 1967. Google Scholar

[3] 3. Grünbaum, B., Regularity of graphs, complexes and designs, to appear. Google Scholar

[4] 4. König, D., Theorie der endlichen und unendlichen Graphen, New York 1950. Google Scholar

[5] 5. Mader, W., Über die Anzahl der von den 1-Faktoren eines Graphen uberdeckten Ecken, Math. Nachr. 56 (1973), 195-200. Google Scholar

[6] 6. Mader, W., 1-Faktoren von Graphen, Math. Ann. 201 (1973), 269-282. Google Scholar

[7] 7. Tait, P. G., Some elementary properties of closed plane curves, Messenger Math. (2) 6 (1877), 132-133. Google Scholar

[8] 8. Zaks, J., On the l-factors of n-connected graphs, J. Combinatorial Theory B (1971), 169-181. Google Scholar

Cité par Sources :