1. Atta S, Goldstein S, Mahapatra PRS (2017) No-hole
$$\lambda $$
λ
-L (k, k - 1,., 2, 1)-labeling for square grid. Bulletin de la Société des Sciences et des Lettres de Łódź Série: Recherches sur les Déformations 67(3):9–19
2. Bertossi AA, Pinotti CM, Tan RB (2003) Channel assignment with separation for interference avoidance in wireless networks. IEEE Trans Parallel Distrib Syst 14(3):222–235
3. Bodlaender HL, Kloks T, Tan RB, van Leeuwen J (2000)
$$\lambda $$
λ
-coloring of graphs. In: Annual symposium on theoretical aspects of computer science, Springer, pp 395–406
4. Calamoneri T, Fusco EG, Tan RB, Vocca P (2006) L (h, 1, 1)-labeling of outerplanar graphs. In: International colloquium on structural information and communication complexity, Springer, pp 268–279
5. Chang GJ, Kuo D (1996) The L(2,1)-labeling problem on graphs. SIAM J Discrete Math 9(2):309–316