Building blocks for the variety of absolute retracts

DOI10.1016/j.disc.2006.03.036zbMath1098.05071OpenAlexW2004911149MaRDI QIDQ2502901

Gary MacGillivray, Richard C. Brewster

Publication date: 13 September 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.036

zbMATH Keywords

near unanimity function

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Absolute retracts and varieties generated by chordal graphs ⋮ Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts

Cites Work

• Unnamed Item
• On the complexity of H-coloring
• List homomorphisms to reflexive graphs
• Graphs with edge-preserving majority functions
• The smallest graph variety containing all paths
• Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability
• Absolute Retracts and Varieties of Reflexive Graphs
• Near-Unanimity Functions and Varieties of Reflexive Graphs
• A Classification of Reflexive Graphs: The use of “Holes”
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Bi‐arc graphs and the complexity of list homomorphisms