Name
Abstract | ||
|---|---|---|
We prove that there exists a packing of ** copies of a tree of size ** into Kn. Moreover, the proof provides an easy algorithm. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/s00373-004-0583-y | Graphs and Combinatorics |
Keywords | DocType | Volume |
distinct lengths labelling,cyclic packing,easy algorithm,packing of graphs | Journal | 20 |
Issue | ISSN | Citations |
4 | 1435-5914 | 1 |
PageRank | References | Authors |
0.61 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephan Brandt | 1 | 22 | 2.90 |
| Mariusz Woźniak | 2 | 204 | 34.54 |