Homomorphism-homogeneity classes of countable \(L\)-colored graphs
From MaRDI portal
Publication:6621149
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Model theory of denumerable and separable structures (03C15) Infinite graphs (05C63)
Cites Work
- Title not available (Why is that?)
- Some more notions of homomorphism-homogeneity
- Homogeneous graphs
- Permutation monoids and MB-homogeneity for graphs and relational structures
- Homomorphism-homogeneous \(L\)-colored graphs
- Towards a Ryll-Nardzewski-type theorem for weakly oligomorphic structures
- Homomorphism-homogeneous graphs
- Homomorphism-Homogeneous Relational Structures
- Countable Ultrahomogeneous Undirected Graphs
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- Homomorphism and embedding universal structures for restricted classes
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth
- Complexities of Relational Structures
- Constraint Satisfaction Problems with Infinite Templates
- The random graph
This page was built for publication: Homomorphism-homogeneity classes of countable \(L\)-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621149)