If S=(a1, a2,...) is a non-decreasing sequence of positive integers, then an S-packing
coloring of a graph G is a partition of V (G) into sets X1, X2,... such that for each pair of …

The frequency assignment problem asks for assigning frequencies to transmitters in a
wireless network and includes a variety of specific subproblems. In particular, the packing …

Abstract Let a 1, a 2,…, ak be positive integers. An (a 1, a 2,…, ak)-packing coloring of a
graph G is a mapping from V (G) to {1, 2,…, k} such that vertices with color i have pairwise …

The packing chromatic number χ ρ (G) of a graph G is the smallest integer p such that
vertices of G can be partitioned into disjoint classes X 1,…, X p where vertices in X i have …

The packing chromatic number χ _ ρ (G) χ ρ (G) of a graph G is the smallest integer k such
that there exists ak-vertex coloring of G in which any two vertices receiving color i are at …

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 …

The packing chromatic number $\chi $$\rho $(G) of an undirected (resp. oriented) graph G is
the smallest integer k such that its set of vertices V (G) can be partitioned into k disjoint …

The packing chromatic number χ ρ (G) of a graph G is the smallest integer k for which there
exists a mapping π: V (G)⟶{1, 2,…, k} such that any two vertices of color i are at distance at …

The packing chromatic number χ ρ (G) of a graph G is the smallest integer k for which there
exists a vertex coloring Γ: V (G)→{1, 2,…, k} such that any two vertices of color i are at …

For a non-decreasing sequence of positive integers S=(s 1, s 2,…), the S-packing chromatic
number χ S (G) of a graph G is the smallest integer k such that the vertex set of G can be …