NU Polymorphisms on Reflexive Digraphs
From MaRDI portal
Publication:4610183
DOI10.1137/16M110527XzbMath1383.05134OpenAlexW2794720713MaRDI QIDQ4610183
Benoit Larose, Mark H. Siggers
Publication date: 6 April 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m110527x
Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75) Equational logic, Mal'tsev conditions (08B05) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reflexive digraphs with near unanimity polymorphisms
- Regular families of forests, antichains and duality pairs of relational structures
- The strong selection property and ordered sets of finite length
- Clones, order varieties, near unanimity functions and holes
- Algebraic properties of crowns and fences
- Holes in ordered sets
- List homomorphisms to reflexive graphs
- A structure theory for ordered sets
- Order varieties generated by finite posets
- Injective envelope of graphs and transition systems
- A polynomial-time algorithm for near-unanimity graphs
- Near-Unanimity Polymorphisms on Structures with Finite Duality
- Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case
- Near-Unanimity Functions and Varieties of Reflexive Graphs
- Posets, near unanimity functions and zigzags
- Relational Sets and Categorical Equivalence of Algebras
- Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
- A Characterisation of First-Order Constraint Satisfaction Problems
- Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
- Dualities for Constraint Satisfaction Problems
