Before revision:  To fill up the gap, in this paper, we propose new fixed-parameter algorithms for L(p,1)-Labeling by the twin cover number plus the maximum clique size and by the tree-width plus the maximum degree.
After revision:  To fill up the gap, in this paper, we propose new fixed-parameter algorithms for L(p,1)-Labeling by the twin cover number plus the maximum clique size and by the tree-width plus the maximum degree.