1. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms;Booth;J. Comput. System Sci.,1976
2. Homogeneously orderable graphs;Brandstädt;Theoret. Comput. Sci.,1997
3. Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications;Brandstädt,1999
4. A characterization of rigit circuit graphs;Buneman;Discrete Math.,1974
5. D.G. Corneil, S. Olariu, L. Stewart, The ultimate interval graph recognition algorithm? (extended abstract), in: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 25–27 January 1998, pp. 175–180.