2 problems

For a sequence $S=(s_1,\dots,s_k)$ of non-decreasing positive integers, an $S$-packing edge-coloring of a graph $G$ is a partition of $E(G)$ into $E_1,\dots,E_k$ such that the distan…

Subdivision packing-coloring conjecture. The graph $S(G)$ admits a $(1,2,3,4,5)$-packing coloring. Equivalently, every subdivision of a subcubic graph has packing chromatic number…