1. Lecture Notes in Computer Science;I. Adler,2010
2. Lecture Notes in Computer Science;A. Brandstädt,1985
3. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey (1999)
4. Brandstädt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67 (2003)
5. Bui-Xuan, B.M., Telle, J.A., Vatshelle, M.: Fast algorithms for vertex subset and vertex partitioning problems on graphs of low boolean-width. arXiv