The complexity of L(p,q)-Edge-Labelling
share
We classify the complexity of L(p,q)-Edge-k-Labelling in the sense that for all positive integers p and q we exhibit k so that we can show L(p,q)-Edge-k-Labelling is NP-complete.
READ FULL TEXTWe classify the complexity of L(p,q)-Edge-k-Labelling in the sense that for all positive integers p and q we exhibit k so that we can show L(p,q)-Edge-k-Labelling is NP-complete.
READ FULL TEXT