Motivated by previous results on distance constrained labelings and coloring of squares of K"4-minor free graphs, we show that for every p>=q>=1, there exists @D"0 such that every K"4-minor free graph G with maximum degree @D>=@D"0 has an L(p,q)-labeling of span at most q@?3@D(G)/2@?. The obtained bound is the best possible.
['Daniel Král', 'Pavel Nejedlý']
Distance constrained labelings of K4 -minor free graphs