L(h, k) coloring in graph theory, is a (proper) vertex coloring in which every pair of adjacent vertices has color numbers that differ by at least h, and any pair of vertices at distance 2 have their colors differ by at least k. When h=1 and k=0, it is the usual (proper) vertex coloring.
References
L(h, k)-coloring Wikipedia(Text) CC BY-SA