Semilattice polymorphisms and chordal graphs

DOI10.1016/J.EJC.2013.10.007zbMATH Open1284.05125OpenAlexW2027966825MaRDI QIDQ2441663FDOQ2441663

Mark Siggers, Pavol Hell

Publication date: 25 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.10.007

zbMATH Keywords

reflexive graphsleafage of a chordal graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Closure properties of constraints
• The leafage of a chordal graph
• Reflexive digraphs with near unanimity polymorphisms
• List homomorphisms to reflexive graphs
• Near-Unanimity Functions and Varieties of Reflexive Graphs
• A polynomial-time algorithm for near-unanimity graphs
• Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case
• Finite posets and topological spaces in locally finite varieties
• Absolute Retracts and Varieties of Reflexive Graphs
• Graphs with edge-preserving majority functions
• A discrete homotopy theory for binary reflexive structures
• Two new homomorphism dualities and lattice operations
• Semilattice polymorphisms and chordal graphs
• Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
• The Complexity of Constraint Satisfaction Problems (Invited Talk)

Cited In (5)

• Semilattice polymorphisms and chordal graphs
• Algebra and the Complexity of Digraph CSPs: a Survey
• Title not available (Why is that?)
• Reflexive graphs with near unanimity but no semilattice polymorphisms
• 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)