On classes of relations and graphs determined by subobjects and factorobjects

Cites work

scientific article; zbMATH DE number 3520447 (Why is no real title available?)
Graph Theory and Probability
Graphs and k-Societies
On full embeddings of categories of algebras
Paths, Trees, and Flowers
Productive classes and subdirect irreducibility, in particular for graphs

Cited in

(51)

In praise of homomorphisms
Hedetniemi's conjecture and strongly multiplicative graphs
On Sabidussi--Fawcett subdirect representation
Many Facets of Dualities
Open questions related to the problem of Birkhoff and Maltsev
Residual properties of simple graphs
Duality theorems for finite structures (characterising gaps and good characterisations)
Density via duality.
Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
Colouring, constraint satisfaction, and complexity
Multiplicativity of acyclic local tournaments
Dualities for Constraint Satisfaction Problems
On the complexity of H-coloring
Subdirect decomposition of \(n\)-chromatic graphs
Homomorphisms to oriented cycles
Oriented incidence colourings of digraphs
Path homomorphisms
Multiplicativity of acyclic digraphs
Dualizability of graphs
On multiplicative graphs and the product conjecture
On maximal objects in classes of (di)graphs determined by prescribed factorobjects
Homomorphic image orders on combinatorial structures.
Finitely axiomatizable quasivarieties of graphs
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
Dualities and dual pairs in Heyting algebras
Connected obstructions to full graph homomorphisms
Note on strong product graph dimension
Axiomatisability and hardness for universal Horn classes of hypergraphs
Dualities in full homomorphisms
Colored graphs without colorful cycles
On the complexity of colouring by superdigraphs of bipartite graphs
Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
The effect of two cycles on the complexity of colourings by directed graphs
Boolean topological graphs of semigroups: the lack of first-order axiomatization
A surprising permanence of old motivations (a not-so-rigid story)
Interleaved adjoints of directed graphs
A simple proof of the multiplicativity of directed cycles of prime power length
Constraint satisfaction, irredundant axiomatisability and continuous colouring
The axiomatizability of topological prevarieties
Hereditarily hard \(H\)-colouring problems
Flat algebras and the translation of universal Horn logic to equational logic
Quasi-equational bases for graphs of semigroups, monoids and groups.
The algebra of adjacency patterns: Rees matrix semigroups with reversion
Structural Properties of Sparse Graphs
On infinite-finite duality pairs of directed graphs
A note on maxflow-mincut and homomorphic equivalence in matroids
Homomorphisms to oriented paths
No finite-infinite antichain duality in the homomorphism poset of directed graphs
Path homomorphisms, graph colorings, and Boolean matrices
Forbidden lifts (NP and CSP for combinatorialists)

This page was built for publication: On classes of relations and graphs determined by subobjects and factorobjects

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