On Maltsev digraphs

zbMath1308.05053MaRDI QIDQ2260621

Marcel Jackson, Todd Niven, Catarina A. Carvalho, László Egri

Publication date: 11 March 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p47

zbMATH Keywords

digraphpolymorphismconstraint satisfaction problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Applications of universal algebra in computer science (08A70) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Quantified Constraints in Twenty Seventeen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maltsev digraphs have a majority polymorphism
• Existence theorems for weakly symmetric operations
• On the complexity of H-coloring
• On \(n\)-permutable congruences
• Majority constraints have bounded pathwidth duality
• CSP DICHOTOMY FOR SPECIAL POLYADS
• On the complexity of #CSP
• On Constraint Satisfaction Problems below P
• On Maltsev Digraphs
• CSP dichotomy for special triads
• The Recognition of Series Parallel Digraphs
• Closure properties of constraints
• Linear Datalog and Bounded Path Duality of Relational Structures
• Classifying the Complexity of Constraints Using Finite Algebras
• Space complexity of list H-colouring: a dichotomy
• On the Reduction of the CSP Dichotomy Conjecture to Digraphs
• A Simple Algorithm for Mal'tsev Constraints
• Dualities for Constraint Satisfaction Problems

This page was built for publication: On Maltsev digraphs