Graphs admitting k-NU operations. II: The irreflexive case
From MaRDI portal
Publication:3192166
DOI10.1137/130914784zbMATH Open1298.05272OpenAlexW4249393729MaRDI QIDQ3192166FDOQ3192166
Authors: Benoît Larose, Claude Tardif, Tomás Feder, Pavol Hell, Mark Siggers 
Publication date: 26 September 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130914784
Recommendations
- Graphs admitting \(k\)-NU operations. I: The reflexive case
- NU polymorphisms on reflexive digraphs
- Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts
- Reflexive graphs with near unanimity but no semilattice polymorphisms
- Reflexive digraphs with near unanimity polymorphisms
Structural characterization of families of graphs (05C75) Equational logic, Mal'tsev conditions (08B05)
Cited In (8)
- List-homomorphism problems on graphs and arc consistency
- Graphs admitting \(k\)-NU operations. I: The reflexive case
- Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts
- Semilattice polymorphisms and chordal graphs
- Near-Unanimity Functions and Varieties of Reflexive Graphs
- NU polymorphisms on reflexive digraphs
- Reflexive graphs with near unanimity but no semilattice polymorphisms
- Algebra and the complexity of digraph CSPs: a survey
This page was built for publication: Graphs admitting \(k\)-NU operations. II: The irreflexive case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192166)
