Near-Unanimity Functions and Varieties of Reflexive Graphs
From MaRDI portal
Recommendations
- Reflexive graphs with near unanimity but no semilattice polymorphisms
- Reflexive digraphs with near unanimity polymorphisms
- Graphs admitting k-NU operations. II: The irreflexive case
- Graphs admitting \(k\)-NU operations. I: The reflexive case
- Weak near-unanimity functions and digraph homomorphism problems
Cited in
(22)- Graph partitions with prescribed patterns
- Absolute retracts and varieties generated by chordal graphs
- Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts
- Colouring, constraint satisfaction, and complexity
- Semilattice polymorphisms and chordal graphs
- scientific article; zbMATH DE number 7561584 (Why is no real title available?)
- Posets, near unanimity functions and zigzags
- The structure of bi-arc trees
- Consistency for counting quantifiers
- Building blocks for the variety of absolute retracts
- Jónsson terms and near-unanimity functions in finite posets
- Reflexive digraphs with near unanimity polymorphisms
- Bi‐arc graphs and the complexity of list homomorphisms
- Testing list H-homomorphisms
- Weak near-unanimity functions and digraph homomorphism problems
- NU polymorphisms on reflexive digraphs
- Reflexive graphs with near unanimity but no semilattice polymorphisms
- The complexity of the list homomorphism problem for graphs
- Algebra and the complexity of digraph CSPs: a survey
- Clones, order varieties, near unanimity functions and holes
- Near-Unanimity Polymorphisms on Structures with Finite Duality
- Bi-arc digraphs: recognition algorithm and applications
This page was built for publication: Near-Unanimity Functions and Varieties of Reflexive Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393427)
