We consider three colouring problems which are variations of the basic vertex-colouring problem, and are motivated by applications from various domains. We give pointers to theoretical and algorithmic developments for each of these variations.