Semilattice polymorphisms and chordal graphs
From MaRDI portal
(Redirected from Publication:2441663)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1487982 (Why is no real title available?)
- A discrete homotopy theory for binary reflexive structures
- A polynomial-time algorithm for near-unanimity graphs
- Absolute Retracts and Varieties of Reflexive Graphs
- Closure properties of constraints
- Finite posets and topological spaces in locally finite varieties
- Graphs admitting \(k\)-NU operations. I: The reflexive case
- Graphs admitting \(k\)-NU operations. II: The irreflexive case
- Graphs with edge-preserving majority functions
- List homomorphisms to reflexive graphs
- Near-Unanimity Functions and Varieties of Reflexive Graphs
- Reflexive digraphs with near unanimity polymorphisms
- Semilattice polymorphisms and chordal graphs
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The complexity of constraint satisfaction problems (invited talk)
- The leafage of a chordal graph
- Two new homomorphism dualities and lattice operations
Cited in
(6)- Semilattice polymorphisms and chordal graphs
- scientific article; zbMATH DE number 617577 (Why is no real title available?)
- Distributive lattice polymorphisms on reflexive graphs
- Reflexive graphs with near unanimity but no semilattice polymorphisms
- Algebra and the complexity of digraph CSPs: a survey
- Semi-graphs of anabelioids
This page was built for publication: Semilattice polymorphisms and chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441663)