Combinatorially homogeneous graphs

DOI10.1016/0095-8956(81)90065-4MaRDI QIDQ1159700zbMATH OpenOpenAlexFDO

Authors Hikoe Enomoto

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

zbMATH Keywords

subgraph isomorphismultrahomogeneous

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• A new 5‐arc‐transitive cubic graph
• Homogeneity conditions in graphs
• Homogeneous graphs
• scientific article; zbMATH DE number 3520434 (Why is no real title available?)
• On Homogeneous Graphs
• Smoothly Embeddable Subgraphs

Cited in

(16)

• \(k\)-CS-transitive infinite graphs
• The classification of finite and locally finite connected-homogeneous digraphs
• Locally finite homogeneous graphs
• Countable homogeneous Steiner triple systems avoiding specified subsystems
• Transitivity conditions in infinite graphs
• Locally-finite connected-homogeneous digraphs
• A survey of homogeneous structures
• On k-connected-homogeneous graphs
• Orbit-equivalent infinite permutation groups.
• Finite 3-connected-set-homogeneous locally \(2\mathbf{K}_n\) graphs and \(s\)-arc-transitive graphs
• Connected-homomorphism-homogeneous graphs
• Homomorphism-homogeneous graphs
• Set-homogeneous directed graphs
• The classification of connected-homogeneous digraphs with more than one end
• Set‐homogeneous hypergraphs
• Countable connected-homogeneous graphs

This page was built for publication: Combinatorially homogeneous graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159700)