Decomposition of complete graphs into trees
Czechoslovak Mathematical Journal (1975)
- Volume: 25, Issue: 1, page 31-36
- ISSN: 0011-4642
Access Full Article
top
How to cite
topHaggard, Gary, and McWha, Peter. "Decomposition of complete graphs into trees." Czechoslovak Mathematical Journal 25.1 (1975): 31-36. <http://eudml.org/doc/12837>.
@article{Haggard1975,
author = {Haggard, Gary, McWha, Peter},
journal = {Czechoslovak Mathematical Journal},
keywords = {tree; complete graph; cyclic decomposition},
language = {eng},
number = {1},
pages = {31-36},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Decomposition of complete graphs into trees},
url = {http://eudml.org/doc/12837},
volume = {25},
year = {1975},
}
TY - JOUR
AU - Haggard, Gary
AU - McWha, Peter
TI - Decomposition of complete graphs into trees
JO - Czechoslovak Mathematical Journal
PY - 1975
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 25
IS - 1
SP - 31
EP - 36
LA - eng
KW - tree; complete graph; cyclic decomposition
UR - http://eudml.org/doc/12837
ER -
References
top- 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. (1969) MR1535687
- R. Guy, V. Klee, Monthly Research Problems 1969-71, Amer. Math. Monthly 78 (1971), 1113-1122. (1971) MR1536553
- F. Harary, Graph Theory, Addison-Wesley, 1969. (1969) Zbl0196.27202MR0256911
- 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. (1966) MR0223271
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.