All Title Author
Keywords Abstract


A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles

Full-Text   Cite this paper   Add to My Lib

Abstract:

In this paper we give a graph theoretic proof of the fact that deciding whether a homomorphism exists to a fixed local tournament with at least two directed cycles is NP-complete. One of the main reasons for the graph theoretic proof is that it showcases all of the techniques that have been built up over the years in the study of the digraph homomorphism problem.

Full-Text

comments powered by Disqus