Calamoneri, Tiziana; Fusco, Emanuele; Tan, Richard; … - In: Mathematical Methods of Operations Research 69 (2009) 2, pp. 307-321
An L(h, 1, 1)-labeling of a graph is an assignment of labels from the set of integers {0, . . . , λ} to the nodes of the graph such that adjacent nodes are assigned integers of at least distance h ≥ 1 apart and all nodes of distance three or less must be assigned different labels. The aim...
