Decomposition of complete graphs into trees
Czechoslovak Mathematical Journal, Tome 25 (1975) no. 1, pp. 31-36
@article{10_21136_CMJ_1975_101291,
author = {Haggard, Gary and McWha, Peter},
title = {Decomposition of complete graphs into trees},
journal = {Czechoslovak Mathematical Journal},
pages = {31--36},
year = {1975},
volume = {25},
number = {1},
doi = {10.21136/CMJ.1975.101291},
mrnumber = {0369116},
zbl = {0436.05051},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1975.101291/}
}
TY - JOUR AU - Haggard, Gary AU - McWha, Peter TI - Decomposition of complete graphs into trees JO - Czechoslovak Mathematical Journal PY - 1975 SP - 31 EP - 36 VL - 25 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1975.101291/ DO - 10.21136/CMJ.1975.101291 LA - en ID - 10_21136_CMJ_1975_101291 ER -
Haggard, Gary; McWha, Peter. Decomposition of complete graphs into trees. Czechoslovak Mathematical Journal, Tome 25 (1975) no. 1, pp. 31-36. doi: 10.21136/CMJ.1975.101291
[1] R. Duke: Can the complete graph with 2n + 1 vertices be packed with copies of an arbitrary tree having n edges?. Amer. Math. Monthly 76 (1969), 1128-1130. | MR
[2] R. Guy, V. Klee: Monthly Research Problems 1969-71. Amer. Math. Monthly 78 (1971), 1113-1122. | MR
[3] F. Harary: Graph Theory. Addison-Wesley, 1969. | MR | Zbl
[4] A. Rosa: On certain valuations of the vertices of a graph. Theory of Graphs, Proc. Intern. Symp. Rome in July 1966, Gordon and Breach, New York 1967, 349-355. | MR
Cité par Sources :