1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. Lecture Notes in Computer Science;L. Babel,1995
3. K.S. Booth, C.J. Colbourn, Problems polynomially equivalent to graph isomorphism, Report No. CS-77-04, Computer Science Department, University of Waterloo (1979).
4. K.S. Booth, G.S. Lueker, A linear time algorithm for deciding interval graph isomorphism, Journal of the ACM, 26 (1979), 183–195.
5. V. Chvatal, Perfectly ordered graphs, in: C. Berge and V. Chvatal, eds., Topics on Perfect Graphs, North-Holland, Amsterdam, 1984, 63–65.