Labeled packing of a non-star tree into its sixth power

In 2013, Duchêne et al. [3] introduced a new variant of the graph packing problem, called labeled packing of a graph. In this paper, we introduce some results on the labeled packing of a non-star tree into its sixth power. First, we show that there exists a labeled packing of a path P n , n ≥ 4 , into P n 4 with ⌈ n 4 ⌉ labels. We also prove that we can find a labeled packing of a non-star tree T into T 6 with m T + ⌈ n − m T 5 ⌉ labels, where n is the number of vertices of T and m T denotes the maximum number of leaves that can be removed from T in such a way that the obtained tree is a non-star one.