Surjective \(H\)-colouring: new hardness results (Q2011662): Difference between revisions

@@ Property / author @@
+Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963006808
@@ Property / OpenAlex ID: W2963006808 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02188
@@ Property / arXiv ID: 1701.02188 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of surjective homomorphism problems-a survey
+Normal rank
@@ Property / cites work @@
+Bi‐arc graphs and the complexity of list homomorphisms
+Normal rank
@@ Property / cites work @@
+Retractions to Pseudoforests
@@ Property / cites work: Retractions to Pseudoforests / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+Locally constrained graph homomorphisms -- structure, complexity, and applications
+Normal rank
@@ Property / cites work @@
+A complete complexity classification of the role assignment problem
+Normal rank
@@ Property / cites work @@
+Finding vertex-surjective graph homomorphisms
@@ Property / cites work: Finding vertex-surjective graph homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Computing vertex-surjective homomorphisms to partially reflexive trees
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of disconnected cut and \(2 K_2\)-partition
+Normal rank
@@ Property / cites work @@
+Q4448767
@@ Property / cites work: Q4448767 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Compaction to Reflexive Cycles
+Normal rank
@@ Property / cites work @@
+Compaction, Retraction, and Constraint Satisfaction
+Normal rank
@@ Property / cites work @@
+A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
+Normal rank
@@ Property / cites work @@
+Algorithms for partition of some class of graphs under compaction and vertex-compaction
+Normal rank