1. Data Structures and Algorithms;Aho,1983
2. “Embedding Partial Steiner Triple Systems”;Andersen;Proceedings London Math. Society,1980
3. B.A. Anderson, “Sequencing and Houses”, Proceedings of the Fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, 1984, pp. 23–45.
4. “An Efficient Algorithm for Colouring the Edges of a Graph with d+1 Colours”;Arjomandi;INFOR,1982
5. L. Babai, “On the Isomorphism Problem”, unpublished manuscript, 1977.