科研之友
微信
新浪微博
Facebook
分享链接
摘要
The concept of a packing colouring is related to a frequency assignment problem. The packing chromatix number X(p)(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), where vertices in X(i) have pairwise distance greater than i. In this note we improve the upper bound on the packing chromatic number of the square lattice.
- 出版日期2010-3-15
