The following pages link to Complexity of tree homomorphisms (Q1923593):
Displaying 16 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Residual properties of pre-bipartite digraphs (Q616134) (← links)
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- Adjusted Interval Digraphs (Q2839215) (← links)
- The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) (← links)
- CSP dichotomy for special triads (Q3395563) (← links)
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditions (Q4958331) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)
- The smallest hard trees (Q6073305) (← links)
