Pages that link to "Item:Q3022752"
From MaRDI portal
The following pages link to A polynomial-time algorithm for near-unanimity graphs (Q3022752):
Displayed 11 items.
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Reflexive digraphs with near unanimity polymorphisms (Q442320) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
- Recolouring reflexive digraphs (Q1744757) (← links)
- Reflexive graphs with near unanimity but no semilattice polymorphisms (Q1991407) (← links)
- Reconfiguration of homomorphisms to reflexive digraph cycles (Q2032862) (← links)
- Semilattice polymorphisms and chordal graphs (Q2441663) (← links)
- The existence of a near-unanimity function is decidable (Q2449447) (← links)
- NU Polymorphisms on Reflexive Digraphs (Q4610183) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)