Let G be a simple graph with n vertices, which is regular of degree d. By considering the number of vertices that can be assigned the same colour, prove that chromatic number of G, X(G), X(G)>= n/(n - d ).