1. T. Asano, Difficulty of the maximum independent set problem on intersection graphs of geometric objects, Graph Theory, Combinatorics, and Applications, Vol. 1, Kalamazoo, MI, 1988, Wiley-Interscience Publication, Wiley, New York, 1991, pp. 9–18.
2. A. Brandstädt, V.B. Le, J.P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1999.
3. E. Čenek, Subtree overlap graphs and the maximum independent set problem, M.Sc. Thesis, Department of Computing Science, University of Alberta, 1998.
4. Partially ordered sets;Dushnik;Amer. J. Math.,1941
5. A. Frank, Some polynomial algorithms for certain graphs and hypergraphs, Proceedings of the Fifth British Combinatorial Conference, University of Aberdeen, Aberdeen, 1975, pp. 211–226; Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976.