Abstract
The packing chromatic number of a graph is the smallest integer such that the vertex set can be partitioned into disjoint classes , where vertices in have pairwise distance greater than . For the 2-dimensional square lattice it is proved that , which improves the previously known lower bound 10.
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.