On uniquely packable trees

Abstract

An i-packing in a graph G is a set of vertices that are pairwise at distance more than i. A packing colouring of G is a partition X = {X1, X2, . . . , Xk } of V(G) such that each colour class Xi is...