Reflexive graphs with near unanimity but no semilattice polymorphisms
From MaRDI portal
Publication:1991407
zbMath1401.05253MaRDI QIDQ1991407
Publication date: 30 October 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p2
Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75) Equational logic, Mal'tsev conditions (08B05)
Related Items (1)
Cites Work
- Reflexive digraphs with near unanimity polymorphisms
- Colouring, constraint satisfaction, and complexity
- An algebraic setting for near-unanimity consensus
- Graphs with edge-preserving majority functions
- Algebraic properties and dismantlability of finite posets
- Semilattice polymorphisms and chordal graphs
- A polynomial-time algorithm for near-unanimity graphs
- Absolute Retracts and Varieties of Reflexive Graphs
- Near-Unanimity Functions and Varieties of Reflexive Graphs
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Distributive Lattice Polymorphism on Reflexive Graphs
- Algebra and the Complexity of Digraph CSPs: a Survey
- Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
This page was built for publication: Reflexive graphs with near unanimity but no semilattice polymorphisms
