In the paper we solve long-lasting conjecture by showing that the L(p,q) labeling problem for trees is NP-complete whenever q is not a divisor of p.
In the paper we solve long-lasting conjecture by showing that the L(p,q) labeling problem for trees is NP-complete whenever q is not a divisor of p. (en)