Title:
|
Decomposition of complete graphs into trees (English) |
Author:
|
Haggard, Gary |
Author:
|
McWha, Peter |
Language:
|
English |
Journal:
|
Czechoslovak Mathematical Journal |
ISSN:
|
0011-4642 (print) |
ISSN:
|
1572-9141 (online) |
Volume:
|
25 |
Issue:
|
1 |
Year:
|
1975 |
Pages:
|
31-36 |
Summary lang:
|
English |
. |
Category:
|
math |
. |
MSC:
|
05C05 |
idZBL:
|
Zbl 0436.05051 |
idMR:
|
MR0369116 |
DOI:
|
10.21136/CMJ.1975.101291 |
. |
Date available:
|
2008-06-09T14:10:31Z |
Last updated:
|
2020-07-28 |
Stable URL:
|
http://hdl.handle.net/10338.dmlcz/101291 |
. |
Reference:
|
[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 1535687 |
Reference:
|
[2] R. Guy, V. Klee: Monthly Research Problems 1969-71.Amer. Math. Monthly 78 (1971), 1113-1122. MR 1536553 |
Reference:
|
[3] F. Harary: Graph Theory.Addison-Wesley, 1969. Zbl 0196.27202, MR 0256911 |
Reference:
|
[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 0223271 |
. |