Abstract
An -packing in a graph is a set of vertices at pairwise distance greater than . For a nondecreasing sequence of integers , the -packing chromatic number of a graph is the least integer such that there exists a coloring of into colors where each set of vertices colored , , is an -packing. This paper describes various subdivisions of an -packing into -packings ($j\textgreater{}i$) for the hexagonal, square and triangular lattices. These results allow us to bound the -packing chromatic number for these graphs, with more precise bounds and exact values for sequences , .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.