L(d, 1)-labelings of the edge-path-replacement of a graph. - Damei Lü; Nianfeng Lin (J. Comb. Optim., 2013)

Nordhaus-Gaddum-type results for path covering and L(2, 1)-labeling numbers. - Damei Lü; Juan Du; Nianfeng Lin; Ke Zhang; Dan Yi (J. Comb. Optim., 2015)

L(2, 1)-Edge-Labelings of the Edge-Path-Replacement of a Graph. - Nianfeng Lin; Damei Lü; Jinhua Wang (Int. J. Found. Comput. Sci., 2018)