On classes of relations and graphs determined by subobjects and factorobjects

Cites work

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

Cited in

(52)

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

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)