Sciweavers

CORR
2010
Springer

On Packing Colorings of Distance Graphs

13 years 3 months ago
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
Olivier Togni
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors Olivier Togni
Comments (0)