Graph coloring variation


Are there variations of the classic graph coloring problem that the number of neighbors in the same color is limited but not zero (in the original problem – the limit is zero)?