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 University Press
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/}
}
[1] 1. Bermond, J.C. and Schonheim, J., G-decomposition of Kn, where G has four vertices or less, Discrete Mathematics 19 (1977) 113-120. Google Scholar
[2] 2. Rosa, A. and Huang, C., Another class of Balanced graph designs, Balanced Circuit Designs, Discrete Mathematics 12 (1975) 269-293. Google Scholar
[3] 3. Skolem, Th., On certain distribution of integers in pairs with given differences, Math. Scand. 5 (1957) 57-68. Google Scholar
Cité par Sources :