Article ID Journal Published Year Pages File Type
418772 Discrete Applied Mathematics 2014 7 Pages PDF
Abstract

The packing chromatic number χρ(G)χρ(G) of a graph GG is the smallest integer pp such that vertices of GG can be partitioned into disjoint classes X1,…,XpX1,…,Xp where vertices in XiXi have pairwise distance between them greater than ii. For k

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
The packing coloring of distance graphs D(k,t)D(k,t)
Authors
, , ,