108 research outputs found
A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles
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
A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles
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
An extensive English language bibliography on graph theory and its applications
Bibliography on graph theory and its application
Algebra and the Complexity of Digraph CSPs: a Survey
We present a brief survey of some of the key results on the interplay between algebraic and graph-theoretic methods in the study of the complexity of digraph-based constraint satisfaction problems
- …