Packing two copies of a tree into its third power

Abstract: A graph H of order n is said to be k-placeable into a graph G of order n, if G contains k edge-disjoint copies of H. It is well known that any non-star tree T of order n is 2-placeable into the complete graph . In the paper by Kheddouci et al. [Packing two copies of a tree into its fourth power, Discrete Math. 213 (2000) 169–178], it is proved that any non-star tree T is 2-placeable into . In this paper, we prove that any non-star tree T is 2-placeable into . [Copyright &y& Elsevier]