Packing three copies of a tree into its sixth power

A graph H of order n is said to be k - p l a c e a b l e into a graph G , having the same order n , if G contains k edge-disjoint copies of H . Kaneko et al. [9] proved that any non-star tree T is 2 - p l a c e a b l e into its third power T 3 . In this paper, we give a particular interest on the 3 - p l a c e m e n t of a tree T into its sixth power T 6 .