The paper explores relations between structure of equitable partitions and the existence of a locally constrained homomorphisms. Several results on computational complexity are obtained.