1. Aho, A.V., Hopcroft, J. E., and Ullman, J.D. (1974). The Design and Analysis of Computer Algorithms, Reading: Addison-Wesley.
2. Babai, L., Grigorer, D.Y., and Mount, D.Y. (1982).“Isomorphism of graphs with bounded eigenvalue multiplicity,” Proc. of 14th ACM Symposium on Theory of Computing, pp. 310–324.
3. Babel, L. (1995).“Isomorphism of chordal (6,3) graphs”, Computing, Vol. 54, pp. 303–316.
4. Babel, L., Ponomarenko, I.N., and Tinhofer, G. (1996).“The isomorphism problem for directed path graphs and for rooted directed path graphs,” Journal of Algorithms, Vol. 21, pp. 542–564.
5. Balakrishnau, V. K. (1997). Theory and Problems of Graph Theory, McGraw-Hill.