Labeling planar graphs with a condition at distance two

Abstract

We prove a conjecture of Griggs and Yeh on L(2,1)-labelings of graphs for the class of planar graphs with maximum degree different from three.

Keywords

• Labeling
• planar
• graphs
• condition
• distance
• two