Distance constrained labelings of planar graphs with no short cycles Original Research Article

Motivated by a conjecture of Wang and Lih, we show that every planar graph of girth at least seven and maximum degree image has an image-labeling of span at most image. Since the optimal span of an image-labeling of an infinite image-regular tree is image, the obtained bound is the best possible for any image and image.