Smoothly Embeddable Subgraphs
From MaRDI portal
Cited in
(22)- Combinatorially homogeneous graphs
- Homogeneous graphs
- Glatt einbettbare Untergraphen
- Homogeneity conditions in graphs
- The classification of finite and locally finite connected-homogeneous digraphs
- Binary simple homogeneous structures
- A survey of homogeneous structures
- On k-connected-homogeneous graphs
- On the relational complexity of a finite permutation group
- Binary simple homogeneous structures are supersimple with finite rank
- From the Coxeter graph to the Klein graph
- On sets with rank one in simple homogeneous structures
- Homomorphism-homogeneous graphs
- A classification of finite homogeneous semilinear spaces
- Homogeneous edge-disjoint \(K_{2s}\) and \(T_{st,t}\) unions
- Homogeneous 1-based structures and interpretability in random structures
- Countable homogeneous multipartite graphs
- Classification of countable 2-colored ultrahomogeneous graphs where each color class forms a disjoint union of cliques
- Finite vertex-colored ultrahomogeneous oriented graphs
- Countable ultrahomogeneous 2-colored graphs consisting of disjoint unions of cliques (extended abstract)
- Classification of finite highly regular vertex-colored graphs
- On a C₄-ultrahomogeneous oriented graph
This page was built for publication: Smoothly Embeddable Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044609)