Polymorphisms of small digraphs

MaRDI QIDQ2853188zbMATH OpenFDO

Authors Libor Barto, David Stanovský

Publication date 18 October 2013

Published in Novi Sad Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

constraint satisfaction problempolymorphisms of digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Relational systems, laws of composition (08A02) Applications of universal algebra in computer science (08A70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Complexity and polymorphisms for digraph constraint problems under some basic constructions
• A finer reduction of constraint problems to digraphs
• Asking the Metaquestions in Constraint Tractability
• On the reduction of the CSP dichotomy conjecture to digraphs
• Algebra and the complexity of digraph CSPs: a survey

Cited in

(9)

• A complexity dichotomy for signed \(\mathbf{H}\)-colouring
• On Maltsev digraphs
• On Maltsev digraphs
• A finer reduction of constraint problems to digraphs
• scientific article; zbMATH DE number 7359806 (Why is no real title available?)
• Algebra and the complexity of digraph CSPs: a survey
• Rigid binary relations on a 4-element domain
• Complexity and polymorphisms for digraph constraint problems under some basic constructions
• Maltsev digraphs have a majority polymorphism

This page was built for publication: Polymorphisms of small digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853188)