1. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
2. On graphs with polynomially solvable maximum-weight clique problem;Balas;Networks,1989
3. Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind;Berge;Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe,1961
4. On the complexity of the maximum cut problem;Bodlaender;Nord. J. Comp.,2000
5. On the clique-width of graphs in hereditary classes;Boliac,2002