Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case

DOI10.1137/120894312zbMath1285.05152OpenAlexW2042043812MaRDI QIDQ5408602

Benoit Larose, Cynthia Loten, Claude Tardif, Tomás Feder, Pavol Hell, Mark H. Siggers

Publication date: 10 April 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120894312

zbMATH Keywords

graphsnear-unanimity operation

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Equational logic, Mal'tsev conditions (08B05)

Related Items (5)

NU Polymorphisms on Reflexive Digraphs ⋮ Semilattice polymorphisms and chordal graphs ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ Reflexive graphs with near unanimity but no semilattice polymorphisms ⋮ Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts

This page was built for publication: Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case