Generalized partitions of graphs Original Research Article

A general graph partitioning problem, which includes graph colouring, homomorphism to H, conditional colouring, contractibility to H, and partition into cliques as special cases, is introduced and its complexity is studied.