Packing colouring of some classes of cubic graphs

Daouya Laïche, Eric Sopena

The packing chromatic number $\chi$ $\rho$ (G) of a graph G is the smallest integer k such that its set of vertices V (G) can be partitioned into k disjoint subsets V 1 ,. .. , V k , in…