Let t(G, q) denote the smallest integer t such that the vertex set V of the graph G can be partitioned into t classes V(G)=[Cup ]ti=1Vi such that the number of edges in the induced subgraph 〈Vi〉 for 1[les ]i[les ]t, is divisible by q. Using an algebraic theorem due to Baker and Schmidt we prove that if q is a prime power then t(G, q) can be computed and a corresponding partition can be presented in a polynomial time.