Complexity of locally-injective homomorphisms to tournaments

10/24/2017
by   Stefan Bard, et al.
0

For oriented graphs G and H, a homomorphism f: G → H is locally-injective if, for every v ∈ V(G), it is injective when restricted to some combination of the in-neighbourhood and out-neighbourhood of v. Two of the possible definitions of local-injectivity are examined. In each case it is shown that the associated homomorphism problem is NP-complete when H is a reflexive tournament on three or more vertices with a loop at every vertex, and Polynomial when H is a reflexive tournament on two or fewer vertices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2020

Algorithms for the rainbow vertex coloring problem on graph classes

Given a vertex-colored graph, we say a path is a rainbow vertex path if ...
research
05/22/2021

Parameterized Complexity of Locally Minimal Defensive Alliances

The Defensive Alliance problem has been studied extensively during the l...
research
08/06/2022

Parameterized Algorithms for Locally Minimal Defensive Alliance

A set D of vertices of a graph is a defensive alliance if, for each elem...
research
03/14/2021

Decomposing and colouring some locally semicomplete digraphs

A digraph is semicomplete if any two vertices are connected by at least ...
research
06/24/2017

Tree-Residue Vertex-Breaking: a new tool for proving hardness

In this paper, we introduce a new problem called Tree-Residue Vertex-Bre...
research
10/08/2020

Defensive Domination in Proper Interval Graphs

k-defensive domination, a variant of the classical domination problem on...
research
06/10/2023

Computational Complexity of Covering Disconnected Multigraphs

The notion of graph covers is a discretization of covering spaces introd...

Please sign up or login with your details

Forgot password? Click here to reset