L(h, k)-coloring

L(h, k)-coloring, also known as Locally-Uniform (h, k)-coloring or simply L(h, k)-coloring, is a concept in graph theory that deals with the assignment of colors to the vertices of a graph. The goal is to satisfy certain locality constraints in the color assignments.