Packing chromatic number of subdivisions of cubic graphs

József Balogh, Alexandr Kostochka, Xujun Liu

A packing $k$-coloring of a graph $G$ is a partition of $V(G)$ into sets $V_1,\dots ,V_k$ such that for each $1\le i\le k$ the distance between any two distinct $x,y\in V_i$ is a…