Distance constrained labelings of planar graphs with no short cycles

Abstract

We prove optimal bounds on L(p,1)-labellings of planar graphs with girth at least seven and large maximum degree.

Keywords

• Distance
• constrained
• labelings
• planar
• graphs
• short
• cycles