1. Amilhastre, J., Janssen, P., Vilarem, M.C.: Computing a minimum biclique cover is polynomial for bipartite domino-free graphs. In: Proceedings of the Eight Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1997, pp. 36–42 (1997)
2. Benczúr, A.A.: Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems. Discrete Appl. Math. 129(2-3), 233–262 (2003)
3. Lecture Notes in Computer Science;A. Brandstädt,1989
4. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: A survey. SIAM, Philadelphia (1999)
5. Ceroi, S.: Ordres et géométrie plane: Application au nombre de sauts. Ph.D. thesis, Université Montpellier II (2000)