The following pages link to (Q4432211):
Displayed 12 items.
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- Graph homomorphisms and nodal domains (Q852625) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
- Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
- Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
- Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)