1. , and , Graphs and Digraphs. Wadsworth International, Belmont, CA (1981).
2. and , Graph decompositions and G-designs. Proceedings of the Fifth British Combinatorial Conference. Utilitas Mathematics, Winnipeg (1976) 53–72.
3. Every graph is an induced isopart of a circulant
4. A note on path-perfect graphs
5. Springer Lect;Graham,1973