1. N. Alon, R. Yuster, and U. Zwick, Finding and counting given length cycles, Algorithmica, 17 (1997), pp. 209–223.
2. S. Booth and G. Lueker, Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms, J. Comput. System Sci., 13(1976), pp. 335–379.
3. D. G. Corneil, S. Olariu, and L. Stewart, The ultimate interval graph recognition algorithm?, in Proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, 1998, pp. 175–180.
4. D. G. Corneil, S. Olariu, and L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM J. Comput., 28 (1999), pp. 1284–1297.
5. P. Damaschke, Forbidden ordered subgraphs, in Topics in Combinatorics and Graph Theory, R. Bodendiek and R. Henn, eds., Physica-Verlag Heidelberg, 1990, pp. 219–229.