
The complexity of colouring by locally semicomplete digraphs
Keywords: پیچیدگی; Digraph homomorphism; Complexity; Polynomial algorithm; NP-completeness; Locally semicomplete digraphs