Abstract
Several possible definitions of local injectivity for a homomorphism of an oriented graph to an oriented graph are considered. In each case, we determine the complexity of deciding whether there exists such a homomorphism when is given and is a fixed tournament on three or fewer vertices. Each possible definition leads to a locally-injective oriented colouring problem. A dichotomy theorem is proved in each case.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.