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 whether or not a graph G allows a homomorphism to a fixed graph H. We continue a study on a variant of this problem, namely the Surjective H-Colouring problem, which imposes the homomorphism to be vertex-surjective. We build upon previous results and show that this problem is NP-complete for every connected graph H that has exactly two vertices with a self-loop as long as these two vertices are not adjacent. As a result, we can classify the computational complexity of Surjective H-Colouring for every graph H on at most four vertices.

[1]  Pavol Hell,et al.  Bi-arc graphs and the complexity of list homomorphisms , 2003, J. Graph Theory.

[2]  Dmitriy Zhuk,et al.  A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[3]  Narayan Vikas,et al.  Compaction, Retraction, and Constraint Satisfaction , 2004, SIAM J. Comput..

[4]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[5]  Daniël Paulusma,et al.  The computational complexity of disconnected cut and 2K2-partition , 2011, J. Comb. Theory, Ser. B.

[6]  Oded Goldreich,et al.  On Promise Problems: A Survey , 2006, Essays in Memory of Shimon Even.

[7]  Narayan Vikas,et al.  A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results , 2005, J. Comput. Syst. Sci..

[8]  Barnaby Martin,et al.  The complexity of surjective homomorphism problems - a survey , 2011, Discret. Appl. Math..

[9]  Narayan Vikas.  Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction , 2012, Algorithmica.

[10]  Jirí Fiala,et al.  Locally constrained graph homomorphisms - structure, complexity, and applications , 2008, Comput. Sci. Rev..

[11]  Pavol Hell,et al.  List Homomorphisms to Reflexive Graphs , 1998, J. Comb. Theory, Ser. B.

[12]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[13]  NARAYAN VIKAS,et al.  Computational Complexity of Compaction to Reflexive Cycles , 2002, SIAM J. Comput..

[14]  Narayan Vikas,et al.  Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon , 2017, MFCS.

[15]  Jirí Fiala,et al.  A complete complexity classification of the role assignment problem , 2005, Theor. Comput. Sci..

[16]  Jaroslav Nesetril,et al.  Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.

[17]  Gustav Nordh,et al.  Retractions to Pseudoforests , 2010, SIAM J. Discret. Math..

[18]  Jian Song,et al.  Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees , 2011, CSR.

[19]  Daniël Paulusma,et al.  Surjective H-Colouring over Reflexive Digraphs , 2017, STACS.

[20]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[21]  Maurizio Patrignani,et al.  The Complexity of the Matching-Cut Problem , 2001, WG.

[22]  Pavol Hell,et al.  List Homomorphisms and Circular Arc Graphs , 1999, Comb..

[23]  Petr A. Golovach,et al.  Finding vertex-surjective graph homomorphisms , 2012, Acta Informatica.