The purpose of this survey is to bring some order into the growing literature on a type of
graphs which emerged in the past couple of decades under a wealth of names and in …

The packing chromatic number χρ (G) of a graph G is the smallest integer k such that the
vertex set of G can be partitioned into packings with pairwise different widths. Several lower …

A packing k-coloring is a natural variation on the standard notion of graph k-coloring, where
vertices are assigned numbers from {1,…, k}, and any two vertices assigned a common color …

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 …

Packing coloring is a partitioning of the vertex set of a graph with the property that vertices in
the i-th class have pairwise distance greater than i. The main result of this paper is a solution …

A packing k-coloring of a graph G is a partition of V (G) into sets V 1,…, V k such that for each
1≤ i≤ k the distance between any two distinct x, y∈ V i is at least i+ 1. The packing …

The packing chromatic number χρ (G) of a graph G is the smallest integer k such that the
vertex set V (G) can be partitioned into disjoint classes X1,…, Xk, where vertices in Xi have …

A k-independent set in a connected graph is a set of vertices such that any two vertices in
the set are at distance greater than k in the graph. The k-independence number of a graph …

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 …

Let S=(a₁, a₂,...) be an infinite nondecreasing sequence of positive integers. An S-packing
k-coloring of a graph G is a mapping from V (G) to 1, 2,..., k such that vertices with color i …