Answers are grounded in this paper and cite their sources.
For a planar graph G, let Δ(G), $g(G)$, and λ(G;p,q) denote, respectively, its maximum degree, girth, and $L(p,q)$-labeling number. We prove that (1) λ(G;p,q)≤ (2q-1)Δ(G)+4p+4q-4 if g(G)≥ 7; (2) λ(G;p,q)≤ (2q-1)Δ(G)+6p+12q-9 if g(G)≥ 6; (3) λ(G;p,q)≤ (2q-1)Δ(G)+6p+24q-15 if g(G)≥ 5. These bounds have consequences on conjectures by Wegner [Graphs with Given Diameter and a Coloring Problem, preprint, University of Dortmund, Dortmund, Germany, 1977] and Griggs and Yeh [SIAM J. Discrete Math., 5 (1992), pp. 586--595].
No takes yet. Share an insight, caveat, or question.
Wang et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: