1. NP-completeness of the Hamilton cycle problem for bipartite graphs;Akiyama;J. Inform. Process.,1980
2. On the restriction of some NP-complete graph problems to permutation graphs;Brandstädt;Forschungsergebnisse Friedrich-Schiller-Universität Jena N/84/80,1984
3. On domination problems for permutation and other graphs;Brandstädt;Forschungsergebnisse Friedrich-Schiller-Universität Jena N/85/41,1985
4. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms;Booth;J. Comput. System. Sci.,1976
5. Graph Theory with Applications;Bondy,1976