On the packing chromatic number of square and hexagonal lattice
On the packing chromatic number of square and hexagonal lattice
The packing chromatic number χ ρ ( G ) of a graph G is the smallest integer k such that the vertex set V ( G ) can be partitioned into disjoint classes X 1 , …, X k , with the condition that vertices in X i have pairwise …