1. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
2. Farbung von Graphen deren samtliche bzw. deren ungerade Kreise starr sind;Berge;Wiss. Z. Martin Luther Univ. Halle Wittenberg Math-Natur. Reihe,1961
3. Strongly perfect graphs;Berge;Ann. Discrete Math.,1984
4. Dominating sets for split and bipartite graphs;Bertossi;Inform. Process. Lett.,1984
5. Total domination in interval graphs;Bertossi;Inform. Process. Lett.,1986