Colourings, homomorphisms, and partitions of transitive digraphs

We investigate the complexity of generalizations of colourings (acyclic colourings, (k,ℓ)-colourings, homomorphisms, and matrix partitions), for inputs restricted to the class of transitive digraphs. Even though transitive digraphs are nicely structured, many problems are intractable, and their complexity turns out to be difficult to classify. We present some motivational results and several open problems.