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 = {X 1, X 2, . , X k } of V(G) such that each colour class Xi is an i-packing. The minimum order k of a packing colouring is called the packing chromatic number of G, denoted by χρ (G). In this paper we investigate the existence of trees T for which there is only one packing colouring using χρ (T) colours. For the case χρ (T) = 3, we completely characterise all such trees. As a by-product we obtain sets of uniquely 3-χρ -packable trees with monotone χρ -colouring and non-monotone χρ -colouring respectively.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
