On uniquely packable trees

A. Alochukwu, M. Dorfling, E. Jonck

An $i$-packing in a graph $G$ is a set of vertices that are pairwise distance more than $i$ apart. A \emph{packing colouring} of $G$ is a partition $X=\{X_1,X_2,\dots ,X_k\}$…