On Packing Colorings of Distance Graphs

The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Olivier Togni
• Keywords: Chromatic, CORR 2010, Education, Integer, Packing Chromatic Number