| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419530 | Discrete Applied Mathematics | 2010 | 5 Pages |
Abstract
For a positive integer kk, a kk-packing in a graph GG is a subset AA of vertices such that the distance between any two distinct vertices from AA is more than kk. The packing chromatic number of GG is the smallest integer mm such that the vertex set of GG can be partitioned as V1,V2,…,VmV1,V2,…,Vm where ViVi is an ii-packing for each ii. It is proved that the planar triangular lattice TT and the three-dimensional integer lattice Z3Z3 do not have finite packing chromatic numbers.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Arthur S. Finbow, Douglas F. Rall,