On uniquely packable trees

Abstract: 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}, l d o t s, X_{k}

of

V (G)

such that each colour class

X_{i}

is an

i

-packing. The minimum order

k

of a packing colouring is called the packing chromatic number of

G

, denoted by

c h i_{h o} (G)

. In this paper we investigate the existence of trees

T

for which there is only one packing colouring using

c h i_{h} o (T)

colours. For the case

c h i_{h} o (T) = 3

, we completely characterise all such trees. As a by-product we obtain sets of uniquely

3

-

c h i_{h} o

-packable trees with monotone

c h i_{h o}

-coloring and non-monotone

c h i_{h o}

-coloring respectively.

This page was built for publication: On uniquely packable trees