Surjective H-Colouring over Reflexive Digraphs

نویسندگان

  • Benoit Larose
  • Barnaby Martin
  • Daniël Paulusma
چکیده

The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for undirected (partially) reflexive graphs. We introduce endo-triviality, the property of a structure that all of its endomorphisms that do not have range of size 1 are automorphisms, as a means to obtain complexity-theoretic classifications of Surjective H-Colouring in the case of reflexive digraphs. Chen [2014] proved, in the setting of constraint satisfaction problems, that Surjective H-Colouring is NP-complete if H has the property that all of its polymorphisms are essentially unary. We give the first concrete application of his result by showing that every endo-trivial reflexive digraph H has this property. We then use the concept of endo-triviality to prove, as our main result, a dichotomy for Surjective H-Colouring when H is a reflexive tournament: if H is transitive, then Surjective H-Colouring is in NL, otherwise it is NP-complete. By combining this result with some known and new results we obtain a complexity classification for Surjective H-Colouring when H is a partially reflexive digraph of size at most 3. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems

منابع مشابه

The existence totally reflexive covers

Let $R$ be a commutative Noetherian ring. We prove that  over a local ring $R$ every finitely generated $R$-module $M$ of finite Gorenstein projective dimension has a Gorenstein projective cover$varphi:C rightarrow M$ such that $C$ is finitely generated and the projective dimension of $Kervarphi$ is finite and $varphi$ is surjective.

متن کامل

On the complexity of colouring by superdigraphs of bipartite graphs

Bang-Jensen, J., P. Hell and G. MacGillivray, On the complexity of colouring by superdigraphs of bipartite graphs, Discrete Mathematics 109 (1992) 27-44. Let H be a directed graph whose vertices are called colours. An H-colouring of a digraph G is an assignment of these colours to the vertices of G so that if g is adjacent to g’ in G theq colour(g) is adjacent to colour(g’) in H (i.e., a homomo...

متن کامل

The complexity of locally injective homomorphisms

A homomorphism f : G → H, from a digraph G to a digraph H, is locally injective if the restriction of f to N(v) is an injective mapping, for each v ∈ V (G). The problem of deciding whether such an f exists is known as the injective H-colouring problem (INJ-HOMH). In this paper we classify the problem INJ-HOMH as either being a problem in P or a problem that is NPcomplete. This is done in the ca...

متن کامل

Reflexivity of the Automorphism and Isometry Groups of the Suspension of B(h)

The aim of this paper is to show that the automorphism and isometry groups of the suspension of B(H), H being a separable infinite dimensional Hilbert space, are algebraically reflexive. This means that every local automorphism, respectively local surjective isometry of C0(R) ⊗ B(H) is an automorphism, respectively a surjective isometry.

متن کامل

Surjective H-Colouring: New Hardness Results

A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The H-Colouring problem is to decide if a graph G allows a homomorphism to a fixed graph H . We continue a study on a variant of this problem, namely the Surjective...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018