1. Efficient and constructive algorithms for the pathwidth and treewidth of graphs;Bodlaender;J. Algorithms,1996
2. Partitions of graphs into one or two stable sets and cliques;Brandstädt;Discrete Math.,1996
3. A. Brandstädt, P.L. Hammer, V.B. Le, V.V. Lozin, Bisplit graphs, DIMACS TR 2002-44.
4. K. Cameron, E.M. Eschen, C.T. Hoang, R. Sritharan, The list partition problem for graphs, SODA 2004, 2004.
5. M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem, eprint arXiv:math/0212070.