Abstrakt
We discuss partition problems that generalize graph colouring and homomorphism problems, and occur frequently in the study of perfect graphs. Depending on the pattern, we seek a finite forbidden induced subgraph characterization, or at least a polynomial time algorithm.
We give an overview of the current knowledge, focusing on open problems and recent breakthroughs.