Słupecki digraphs

DOI10.1007/S00012-025-00900-ZMaRDI QIDQ6929632zbMATH OpenFDO

Authors Ádám Kunos, Benoît Larose, David Emmanuel Pazmiño Pullas

Publication date 17 September 2025

Published in Algebra Universalis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00012-025-00900-Z

zbMATH Keywords

clonedigraphQCSPsurjective polymorphisms

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Operations and polynomials in algebraic structures, primal algebras (08A40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• A discrete homotopy theory for binary reflexive structures
• A projection property
• Algebra and the complexity of digraph CSPs: a survey
• Algebraic properties of crowns and fences
• Arc consistency and friends
• Finite projective ordered sets
• Function Algebras on Finite Sets
• scientific article; zbMATH DE number 4208122 (Why is no real title available?)
• scientific article; zbMATH DE number 5030273 (Why is no real title available?)
• MINIMAL AUTOMORPHIC POSETS AND THE PROJECTION PROPERTY
• Quantified Constraints in Twenty Seventeen
• Reflexive digraphs with near unanimity polymorphisms
• Surjective H-Colouring over Reflexive Digraphs
• Surjective polymorphisms of directed reflexive cycles
• The clone of operations preserving a cycle with loops

This page was built for publication: Słupecki digraphs

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