On classes of relations and graphs determined by subobjects and factorobjects
From MaRDI portal
Publication:1250117
DOI10.1016/0012-365X(78)90062-6zbMath0388.05039OpenAlexW2134331399MaRDI QIDQ1250117
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(78)90062-6
Related Items (51)
In praise of homomorphisms ⋮ Note on strong product graph dimension ⋮ Homomorphisms to oriented paths ⋮ Oriented incidence colourings of digraphs ⋮ On the complexity of H-coloring ⋮ Finitely axiomatizable quasivarieties of graphs ⋮ Axiomatisability and hardness for universal Horn classes of hypergraphs ⋮ On multiplicative graphs and the product conjecture ⋮ Constraint satisfaction, irredundant axiomatisability and continuous colouring ⋮ Multiplicativity of acyclic digraphs ⋮ No finite-infinite antichain duality in the homomorphism poset of directed graphs ⋮ Dualities and dual pairs in Heyting algebras ⋮ On infinite-finite duality pairs of directed graphs ⋮ 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 ⋮ Many Facets of Dualities ⋮ The effect of two cycles on the complexity of colourings by directed graphs ⋮ Interleaved adjoints of directed graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Flat algebras and the translation of universal Horn logic to equational logic ⋮ The axiomatizability of topological prevarieties ⋮ Path homomorphisms ⋮ Boolean topological graphs of semigroups: the lack of first-order axiomatization ⋮ DUALIZABILITY OF GRAPHS ⋮ Colored graphs without colorful cycles ⋮ A simple proof of the multiplicativity of directed cycles of prime power length ⋮ On the complexity of colouring by superdigraphs of bipartite graphs ⋮ On Sabidussi--Fawcett subdirect representation ⋮ Quasi-equational bases for graphs of semigroups, monoids and groups. ⋮ The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion ⋮ Open questions related to the problem of Birkhoff and Maltsev ⋮ Path homomorphisms, graph colorings, and boolean matrices ⋮ On maximal objects in classes of (di)graphs determined by prescribed factorobjects ⋮ RESIDUAL PROPERTIES OF SIMPLE GRAPHS ⋮ Connected obstructions to full graph homomorphisms ⋮ INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS ⋮ Subdirect decomposition of \(n\)-chromatic graphs ⋮ Multiplicativity of acyclic local tournaments ⋮ Dualities in full homomorphisms ⋮ Hedetniemi's Conjecture and Strongly Multiplicative Graphs ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ A note on maxflow-mincut and homomorphic equivalence in matroids ⋮ Hereditarily hard \(H\)-colouring problems ⋮ Dualities for Constraint Satisfaction Problems ⋮ Structural Properties of Sparse Graphs ⋮ Multiplicative graphs and semi-lattice endomorphisms in the category of graphs ⋮ Duality theorems for finite structures (characterising gaps and good characterisations) ⋮ Density via duality. ⋮ Homomorphisms to oriented cycles ⋮ Homomorphic image orders on combinatorial structures.
Cites Work
This page was built for publication: On classes of relations and graphs determined by subobjects and factorobjects
