Geodesic
Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
Canadian journal of mathematics, Tome 21 (1969) no. 1, pp. 992-1000

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

Although the problem of finding the minimum number of planar graphs into which the complete graph can be decomposed remains partially unsolved, the corresponding problem can be solved for certain other surfaces. For three, the torus, the double-torus, and the projective plane, a single proof will be given to provide the solutions. The same questions will also be answered for bicomplete graphs. 
Beineke, L. W. Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties. Canadian journal of mathematics, Tome 21 (1969) no. 1, pp. 992-1000. doi: 10.4153/CJM-1969-109-4
@article{10_4153_CJM_1969_109_4,
     author = {Beineke, L. W.},
     title = {Minimal {Decompositions} of {Complete} {Graphs} into {Subgraphs} with {Embeddability} {Properties}},
     journal = {Canadian journal of mathematics},
     pages = {992--1000},
     year = {1969},
     volume = {21},
     number = {1},
     doi = {10.4153/CJM-1969-109-4},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-109-4/}
}
TY  - JOUR
AU  - Beineke, L. W.
TI  - Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
JO  - Canadian journal of mathematics
PY  - 1969
SP  - 992
EP  - 1000
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-109-4/
DO  - 10.4153/CJM-1969-109-4
ID  - 10_4153_CJM_1969_109_4
ER  - 
%0 Journal Article
%A Beineke, L. W.
%T Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
%J Canadian journal of mathematics
%D 1969
%P 992-1000
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-109-4/
%R 10.4153/CJM-1969-109-4
%F 10_4153_CJM_1969_109_4

[1] 1. Beineke, L. W. and Harary, F., The thickness of the complete graph, Can. J. Math. 17 (1965), 850–859. Google Scholar

[2] 2. Beineke, L. W., Harary, F., and Moon, J. W., On the thickness of the complete bipartite graph Proc. Cambridge Philos. Soc. 60 (1964), 1–5 Google Scholar

[3] 3. Franklin, P., A six-color problem, J. Math. Phys. 13 (1934), 363–369. Google Scholar

[4] 4. Ringel, G., Die toroidale Dicke des vollstdndigen Graphen, Math. Z. 87 (1965), 19–26. Google Scholar

Cité par Sources :