Packing coloring of some undirected and oriented coronae graphs
Isma Bouchemakh, Daouya Laïche, Éric Sopena · Discussiones Mathematicae Graph Theory · 2017
The packing chromatic number (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 such a way that every two distinct vertices in V i are at distance greater than i in G for every i, 1 i k. For a given integer p 1, the p-corona of a graph G is the graph obtained from G by adding p degree-one neighbors to every vertex of G. In this paper, we determine the packing chromatic number of p-coronae of paths and cycles for every p 1.