Chromatic numbers with closed local modular constraints

Generalizing the notion of odd-sum colorings, a $\mathbb{Z}$-labeling of a graph $G$ is called a closed coloring with remainder $k\mathrm{m}\mathrm{o}\mathrm{d}n$ if the closed neighborhood label sum of each vertex is congruent to $k\mathrm{m}\mathrm{o}\mathrm{d}n$. If such colorings exist, we write ${\chi }_{n,k}(G)$ for the minimum number of colors used for a closed coloring with remainder $k\mathrm{m}\mathrm{o}\mathrm{d}n$ such that no neighboring vertices have the same color. General estimates for ${\chi }_{n,k}(G)$ are given along with evaluations of ${\chi }_{n,k}(G)$ for some finite and infinite order graphs.