1 problem

An $L(2,1)$-labeling of a graph $G$ assigns nonnegative integers to its vertices so that labels of adjacent vertices differ by at least two and labels of vertices at distance two d…