peer reviewedWe study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit a logarithmic natural duality. We characterize the minor homomorphism posets of finite algebras in terms of disjoint unions of dual partition lattices and investigate reconstruction problems for homomorphisms
peer reviewedWe find sufficient conditions for a subclone C of Burle's clone and for a subclone of t...
Two graphs G and H are homomorphism indistinguishable over a class of graphs ? if for all graphs F ?...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit...
We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit...
We study the structure of the partially ordered set of minors of an arbitrary function of several va...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
AbstractEach clone C on a fixed base set A induces a quasi-order on the set of all operations on A b...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
peer reviewedEach clone C on a fixed base set A induces a quasi-order on the set of all operations o...
peer reviewedEach clone C on a fixed base set A induces a quasi-order on the set of all operations o...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
AbstractWe investigate ways in which certain binary homomorphisms of a finite algebra can guarantee ...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
AbstractEach clone C on a fixed base set A induces a quasi-order on the set of all operations on A b...
peer reviewedWe find sufficient conditions for a subclone C of Burle's clone and for a subclone of t...
Two graphs G and H are homomorphism indistinguishable over a class of graphs ? if for all graphs F ?...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit...
We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit...
We study the structure of the partially ordered set of minors of an arbitrary function of several va...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
AbstractEach clone C on a fixed base set A induces a quasi-order on the set of all operations on A b...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
peer reviewedEach clone C on a fixed base set A induces a quasi-order on the set of all operations o...
peer reviewedEach clone C on a fixed base set A induces a quasi-order on the set of all operations o...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
AbstractWe investigate ways in which certain binary homomorphisms of a finite algebra can guarantee ...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
AbstractEach clone C on a fixed base set A induces a quasi-order on the set of all operations on A b...
peer reviewedWe find sufficient conditions for a subclone C of Burle's clone and for a subclone of t...
Two graphs G and H are homomorphism indistinguishable over a class of graphs ? if for all graphs F ?...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
DOI
Add to ORKG