1. [1] K.P. Bogart, P.C. Fishburn, G. Isaak, and L. Langley, “Proper and unit tolerance graphs,” Discrete Appl. Math., vol.60, no.1-3, pp.99-117, 1995.
2. [2] K.S. Booth and C.J. Colbourn, “Problems polynomially equivalent to graph isomorphism,” Computer Science Department, University of Waterloo, Tech. Rep., CS-77-04, 1979.
3. [3] C.J. Colbourn, “On testing isomorphism of permutation graphs,” Networks, vol.11, no.1, pp.13-21, 1981.
4. [4] D.G. Corneil and P.A. Kamula, “Extensions of permutation and interval graphs,” Congr. Numer., vol.58, pp.267-275, 1987.
5. [5] A.R. Curtis, M.C. Lin, R.M. McConnell, Y. Nussbaum, F.J. Soulignac, J.P. Spinrad, and J.L. Szwarcfiter, “Isomorphism of graph classes related to the circular-ones property,” Discrete Math. & Theor. Comput. Sci., vol.15, no.1, pp.157-182, 2013.