An i-packing in a graph G is a subset of vertices of V(G). The cardinality of the largest i-packing
is called the i-packing number and is noted rhoi(G)
The packing chromatic number chirho (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 V1, . . . , Vk, in such a way that every
subset Vi is an i packinh for every i, 1 <= i <= k.
We determine the exact value or upper and lower bounds of the i-packing and the packing
chromatic number number of Petersen generalized graphs.