A general graph partitioning problem, which includes graph colouring, homom
orphism to H, conditional colouring, contractibility to H, and partition in
to cliques as special cases, is introduced and its complexity is studied. (
C) 1999 Published by Elsevier Science B.V. All rights reserved.