Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844): Difference between revisions

@@ Property / cites work @@
+The complexity of surjective homomorphism problems-a survey
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+Finding<i>H</i>-partitions efficiently
@@ Property / cites work: Finding<i>H</i>-partitions efficiently / rank @@
+Normal rank
@@ Property / cites work @@
+\(2K_2\)-partition of some classes of graphs
@@ Property / cites work: \(2K_2\)-partition of some classes of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+List homomorphisms to reflexive graphs
@@ Property / cites work: List homomorphisms to reflexive graphs / rank @@
+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 @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828516
@@ Property / cites work: Q4828516 / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Covering graphs with few complete bipartite subgraphs
+Normal rank
@@ Property / cites work @@
+Linear time low tree-width partitions and algorithmic consequences
+Normal rank
@@ Property / cites work @@
+Grad and classes with bounded expansion. I: Decompositions
+Normal rank
@@ Property / cites work @@
+Grad and classes with bounded expansion. II: Algorithmic aspects
+Normal rank
@@ Property / cites work @@
+Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448767
@@ Property / cites work: Q4448767 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / 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
+Normal rank