The Homomorphism Structure of Classes of Graphs
From MaRDI portal
Recommendations
Cited in
(27)- A surprising permanence of old motivations (a not-so-rigid story)
- Inclusion transformations: \((n,m)\)-graphs and their classification
- On the order of countable graphs
- Axiomatisability and hardness for universal Horn classes of hypergraphs
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Density via duality.
- Hajós and Ore constructions for digraphs
- Homomorphism bounded classes of graphs
- Fractal property of the graph homomorphism order
- An analogue of Hajós' theorem for the circular chromatic number
- Mutation classes of diagrams via infinite graphs
- An universality argument for graph homomorphisms
- scientific article; zbMATH DE number 5291590 (Why is no real title available?)
- scientific article; zbMATH DE number 5308096 (Why is no real title available?)
- On a certain homomorphism properties of graphs II.
- scientific article; zbMATH DE number 4031747 (Why is no real title available?)
- scientific article; zbMATH DE number 1341918 (Why is no real title available?)
- The structure and methods of generation of closed classes of graphs
- scientific article; zbMATH DE number 861321 (Why is no real title available?)
- scientific article; zbMATH DE number 7297854 (Why is no real title available?)
- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
- Grassmann homomorphism and Hajós-type theorems
- Complete analytic equivalence relations
- Density and fractal property of the class of oriented trees
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
- Homomorphisms of (n,m)-graphs with respect to generalised switch
- Classification of Ryser graphs
This page was built for publication: The Homomorphism Structure of Classes of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243078)
