For graphs G and H , a homomorphism from G to H is a function Ï† : V (G) â†’ V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two verticesâ€¦ (More)

An L(2, 1)-labeling of a graph is a mapping from its vertex set into nonnegative integers such that the labels assigned to adjacent vertices differ by at least 2, and labels assigned to vertices ofâ€¦ (More)

In the Token Swapping problem we are given a graph with a token placed on each vertex. Each token has exactly one destination vertex, and we try to move all the tokens to their destinations, usingâ€¦ (More)

A k-radius sequence over an n-element alphabet A is a sequence in which every two elements of A appear within distance at most k (where the distance is defined as the difference of indices). By aâ€¦ (More)

In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper r-coloring Ï† of a graph G. We investigate the problem of finding a properâ€¦ (More)

L(2, 1)-labeling is a graph coloring model inspired by a channel assignment problem in telecommunication. It asks for such a labeling of vertices with nonnegative integers that adjacent vertices getâ€¦ (More)

The generalized list T -coloring is a common generalization of many graph coloring models, including classical coloring, L(p, q)-labeling, channel assignment and T -coloring. Every vertex from theâ€¦ (More)