Abstract
We describe a generating set for the variety of reflexive graphs that admit a compatible k-ary near-unanimity (NU) operation. We further delineate a very simple subset that generates the variety of j-absolute retracts; in particular we show that the class of reflexive graphs with a 4-NU operation coincides with the class of 3-absolute retracts. Our results generalize and encompass several results on NU-graphs and absolute retracts.
| Original language | English |
|---|---|
| Pages (from-to) | 1940-1963 |
| Number of pages | 24 |
| Journal | SIAM Journal on Discrete Mathematics |
| Volume | 27 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2013 |
Keywords
- Graphs
- Near-unanimity operation
Fingerprint
Dive into the research topics of 'Graphs admitting k-NU operations. Part 1: The reflexive case'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver