Labeled 2-packings of trees

Graph packing generally deals with unlabeled graphs. In Duchêne et al. (2013), the authors introduced a new variant of the graph packing problem, called labeled packing of a graph. In the current paper, we present several results about the labeled packing number of trees. Exact values are given in the cases of paths and caterpillars. For a general tree, a lower bound is given thanks to the introduction of the concept of fixed-point free labeled packing.