A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with Ug = V . Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite set-homogeneous digraphs, where we allow some pairs of vertices to have arcs in both directions. Under the assumption that such… (More)

@article{Gray2012SethomogeneousDG,
title={Set-homogeneous directed graphs},
author={Robert Gray and Dugald Macpherson and Cheryl E. Praeger and Gordon F. Royle},
journal={J. Comb. Theory, Ser. B},
year={2012},
volume={102},
pages={474-520}
}