New bounds for the L(h, k) number of regular grids

For any non-negative real values h and k, an L(h, k)-labelling of a graph G = (V,E) is a function L : V R such that |L(u) L(v)| h if (u, v) E and |L(u) L(v)| k if there exists w V such that (u,w) E...