Graphs with edge-preserving majority functions

DOI10.1016/0012-365X(92)90033-CzbMath0766.05024OpenAlexW2025238090WikidataQ127332818 ScholiaQ127332818MaRDI QIDQ1196742

Hans-Jürgen Bandelt

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90033-c

zbMATH Keywords

bipartite graphgraph homomorphismHelly propertyretractabsolute retractmajority functions

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (8)

Majority functions on structures with finite duality ⋮ Semilattice polymorphisms and chordal graphs ⋮ Quantified Constraints in Twenty Seventeen ⋮ Reflexive graphs with near unanimity but no semilattice polymorphisms ⋮ Absolute reflexive retracts and absolute bipartite retracts ⋮ Absolute retracts and varieties generated by chordal graphs ⋮ Building blocks for the variety of absolute retracts ⋮ Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts

Cites Work

• Unnamed Item
• Unnamed Item
• Clones, order varieties, near unanimity functions and holes
• A characterization of absolute retracts of n-chromatic graphs
• Absolute retracts of bipartite graphs
• Products of absolute retracts

This page was built for publication: Graphs with edge-preserving majority functions