The following pages link to \(H\)-coloring dichotomy revisited (Q817769):
Displaying 24 items.
- Dualities and algebras with a near-unanimity term (Q312213) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- \(H\)-colorings of dense hypergraphs (Q456171) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- A strong Mal'cev condition for locally finite varieties omitting the unary type (Q616117) (← links)
- In praise of homomorphisms (Q826325) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- The local loop lemma (Q2302149) (← links)
- Two-element structures modulo primitive positive constructability (Q2310436) (← links)
- A quasi-Mal'cev condition with unexpected application. (Q2351514) (← links)
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- (Q3304125) (← links)
- A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP (Q4957913) (← links)
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditions (Q4958331) (← links)
- Loop conditions for strongly connected digraphs (Q4960455) (← links)
- (Q4993595) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- (Q5091252) (← links)
- Pseudo‐loop conditions (Q5205451) (← links)
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) (Q5222129) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- (Q6065467) (← links)
