I would like a name for the following problem. We consider a relaxed vertex coloring problem, where
Let $k$ be the number of colors
Let $B$ be the set of edges violating coloring, i.e., $$B := \{(u,v) \in E \mid c(u) = c(v)\}$$
Then the objective is something like $k + \beta |B| \to \min$ over all colorings (for some $\beta$).
Does this problem have a name?
Somehow, I can't find anything. "Approximate graph coloring" and similar queries talk about approximations for graph coloring. Maybe there is another objective of form $k^\alpha + \beta |B|^\gamma$ (and maybe coefficients may depend on $|V|$)?
I am particularly interested in the hardness of such problems (the harder the better). E.g., hardness for coloring is pretty crazy. I am also particularly interested in a weighted version of this problem, e.g., $k + \beta \sum_{e \in B} w_e \to \min$.