Combinatorially homogeneous graphs
From MaRDI portal
Publication:1159700
DOI10.1016/0095-8956(81)90065-4zbMath0475.05078OpenAlexW2040926030MaRDI QIDQ1159700
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(81)90065-4
Related Items (16)
Connected-Homomorphism-Homogeneous Graphs ⋮ Finite 3-connected-set-homogeneous locally \(2\mathbf{K}_n\) graphs and \(s\)-arc-transitive graphs ⋮ Set-homogeneous directed graphs ⋮ Set‐homogeneous hypergraphs ⋮ Locally finite homogeneous graphs ⋮ Orbit-equivalent infinite permutation groups. ⋮ The classification of finite and locally finite connected-homogeneous digraphs ⋮ Countable homogeneous Steiner triple systems avoiding specified subsystems ⋮ The classification of connected-homogeneous digraphs with more than one end ⋮ Transitivity conditions in infinite graphs ⋮ Countable connected-homogeneous graphs ⋮ Locally-finite connected-homogeneous digraphs ⋮ A survey of homogeneous structures ⋮ Homomorphism-homogeneous graphs ⋮ \(k\)-CS-transitive infinite graphs ⋮ On \(k\)-connected-homogeneous graphs
Cites Work
This page was built for publication: Combinatorially homogeneous graphs
