Packing coloring of hypercubes with extended Hamming codes

Petr Gregor, Jaka Kranjc, Borut Lužar +1

A {\em packing coloring} of a graph $G$ is a mapping assigning a positive integer (a color) to every vertex of $G$ such that every two vertices of color $k$ are at distance at leas…