Abstract
Abstract A subset A of vertices in a graph G is an r-packing if the distance between every pair of distinct vertices in A is more than r. The packing chromatic number, χ ρ ( G ) , is the smallest k for which there exists some partition V 1 , V 2 , … , V k of the vertex set of G such that V r is an r-packing. We obtain lower and upper bounds for the packing chromatic number of Cartesian products and subdivisions of finite graphs and study the existence of monotone colorings in trees. The infinite, planar triangular lattice and the three dimensional square lattice are shown to have unbounded packing chromatic number.
Sign-in/Register to access full text options 
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.
