| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6872371 | Discrete Applied Mathematics | 2014 | 8 Pages |
Abstract
Let a1,a2,â¦,ak be positive integers. An (a1,a2,â¦,ak)-packing coloring of a graph G is a mapping from V(G) to {1,2,â¦,k} such that vertices with color i have pairwise distance greater than ai. In this paper, we study (a1,a2,â¦,ak)-packing colorings of several lattices including the infinite square, triangular, and hexagonal lattices. For k small, we determine all ai such that these graphs have packing colorings. We also give some exact values and asymptotic bounds.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Wayne Goddard, Honghai Xu,