Decomposition of Kn into Dragons
Canadian mathematical bulletin, Tome 23 (1980) no. 3, pp. 275-279

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

DOI

It is shown that if 1<n ≡ 0 or 1 (mod 2 m), then the edges of Kn may be partitioned into isomorphic copies of a graph D 3(m) and also of a graph D 4(m), graphs consisting respectively of a triangle with an attached path of m - 3 edges or a quadrilateral with an attached path of m - 4 edges. If m is a power of 2 then the above condition is shown to be necessary and sufficient for the existence of such a partition.
Huang, C.; Schonheim, J. Decomposition of Kn into Dragons. Canadian mathematical bulletin, Tome 23 (1980) no. 3, pp. 275-279. doi: 10.4153/CMB-1980-038-3
@article{10_4153_CMB_1980_038_3,
     author = {Huang, C. and Schonheim, J.},
     title = {Decomposition of {Kn} into {Dragons}},
     journal = {Canadian mathematical bulletin},
     pages = {275--279},
     year = {1980},
     volume = {23},
     number = {3},
     doi = {10.4153/CMB-1980-038-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1980-038-3/}
}
TY  - JOUR
AU  - Huang, C.
AU  - Schonheim, J.
TI  - Decomposition of Kn into Dragons
JO  - Canadian mathematical bulletin
PY  - 1980
SP  - 275
EP  - 279
VL  - 23
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1980-038-3/
DO  - 10.4153/CMB-1980-038-3
ID  - 10_4153_CMB_1980_038_3
ER  - 
%0 Journal Article
%A Huang, C.
%A Schonheim, J.
%T Decomposition of Kn into Dragons
%J Canadian mathematical bulletin
%D 1980
%P 275-279
%V 23
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1980-038-3/
%R 10.4153/CMB-1980-038-3
%F 10_4153_CMB_1980_038_3

Cité par Sources :