On the Computational Complexity of the L(2,1)-Labeling Problem for Regular Graphs

Abstract

The paper proves NP-hardness of the L(2,1)-labeling problem on regular graphs

Keywords

• Computational
• Complexity
• -Labeling
• Problem
• Regular
• Graphs