1. Arnborg, S., D. G. Corneil and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAMJ. Alg. Disc. Meth. 8 (1987), pp. 277–284.
2. Brandstädt, A., Special graph classes-A survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universität Duisburg Gesamthochschule, 1991.
3. Memorandum No. 1359;H. J. Broersma,1996
4. Breu, H. and D. G. Kirkpatrick, Algorithms for domination and Steiner tree problems in cocomparability graphs, Manuscript 1993.
5. Chang, M. S., Weighted domination on cocomparability graphs, Proceedings of ISAAC'95, Springer-Verlag, LNCS 1004, 1996, pp. 122–131.