Brešar, Klavžar, Rall, and Wаsh's packing-coloring conjecture for subdivided subcubic graphs

Let $G$ be a subcubic graph, meaning that its maximum degree is at most $3$. Let $D(G)$ be the graph obtained by subdividing every edge of $G$, and let $\chi_p(G)$ denote the packing chromatic number, the smallest $k$ such that $G$ has a packing $(1,2,\ldots,k)$-coloring. Brešar, Klavžar, Rall, and Wash's conjecture. For every subcubic graph $G$,

$$\chi_p(D(G))\leq 5.$$

The conjecture concerns a uniform upper bound on the packing chromatic number after subdividing every edge of a subcubic graph. It was motivated by an earlier question of Gastineau and Togni and was subsequently conjectured by Brešar, Klavžar, Rall, and Wash; the supplied source gives no resolution, so its status remains open.