Name
Abstract | ||
|---|---|---|
It is well known that if a tree T of order n is not a star, then there exists an edge-disjoint placement of two copies of this tree into the complete graph K n . We improve this result by proving that actually two copies of T can be edge-disjointly packed in a much smaller graph, namely in T 4 , the 4th power of T. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(99)00177-6 | Discrete Mathematics |
Keywords | Field | DocType |
complete graph | Discrete mathematics,Combinatorics,Graph power,K-ary tree,Star (graph theory),SPQR tree,Spanning tree,Gomory–Hu tree,Windmill graph,Butterfly graph,Mathematics | Journal |
Volume | Issue | ISSN |
213 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
9 | 0.97 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamamache Kheddouci | 1 | 339 | 53.61 |
| Jean-François Saclé | 2 | 43 | 7.05 |
| Mariusz Woźniak | 3 | 204 | 34.54 |