On the strong chromatic number

Let G be a finite graph with maximum degree at most d. Then, for every partition of V(G) into classes of size 3d - 1, there exists a proper colouring of G with 3d - 1 colours in which each class receives all 3d - 1 colours.