Graphs admitting k-NU operations. I: The reflexive case

DOI10.1137/120894312MaRDI QIDQ5408602zbMATH OpenOpenAlexFDO

Authors Benoît Larose, Cynthia Loten, Claude Tardif, Tomás Feder, Pavol Hell, Mark 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)

Recommendations

• Graphs admitting k-NU operations. II: The irreflexive case
• Reflexive graphs with near unanimity but no semilattice polymorphisms
• NU polymorphisms on reflexive digraphs
• Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts
• Reflexive digraphs with near unanimity polymorphisms

Cited in

(10)

• Reflexive graphs with near unanimity but no semilattice polymorphisms
• Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts
• Semilattice polymorphisms and chordal graphs
• Building blocks for the variety of absolute retracts
• Graphs admitting k-NU operations. II: The irreflexive case
• Near-Unanimity Functions and Varieties of Reflexive Graphs
• All maximal clones of a majority reflexive graph.
• NU polymorphisms on reflexive digraphs
• Algebra and the complexity of digraph CSPs: a survey
• Bi-arc digraphs: recognition algorithm and applications

This page was built for publication: Graphs admitting \(k\)-NU operations. I: The reflexive case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408602)