Packing coloring of some undirected and oriented coronae graphs

Laïche Daouya, Isma Bouchemakh, Eric Sopena

The packing chromatic number $\pcn(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$, \ldots,…