1. On stable cutsets in graphs;Brandstädt;Discrete Appl. Math,2000
2. K. Cameron, E.M. Eschen, C.T. Hoàng, R. Sritharan, The list partition problem for graphs, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, 2004, to appear.
3. M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, Strong Perfect Graph Theorem, In Perfect Graph Conjecture workshop, American Institute of Mathematics, 2002.
4. Recognizing decomposable graphs;Chvátal;J. Graph Theory,1984
5. Star-cutsets and perfect graphs;Chvátal;J. Combin. Theory Ser. B,1985