Homomorphism-homogeneity classes of countable L-colored graphs
From MaRDI portal
Publication:6621149
Recommendations
Cites work
- scientific article; zbMATH DE number 3080680 (Why is no real title available?)
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Complexities of Relational Structures
- Constraint Satisfaction Problems with Infinite Templates
- Countable Ultrahomogeneous Undirected Graphs
- Homogeneous graphs
- Homomorphism and embedding universal structures for restricted classes
- Homomorphism-Homogeneous Relational Structures
- Homomorphism-homogeneous \(L\)-colored graphs
- Homomorphism-homogeneous graphs
- Permutation monoids and MB-homogeneity for graphs and relational structures
- Some more notions of homomorphism-homogeneity
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- The random graph
- Towards a Ryll-Nardzewski-type theorem for weakly oligomorphic structures
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)