1. Coloring perfect degenerate graphs;Aı¨t Haddadène;Discrete Math.,1997
2. A polynomial algorithm for finding the largest independent sets in fork-free graphs;Alekseev;Discrete Anal. Oper. Res. Ser.,1999
3. Independent sets of maximum weight in (p,q)-colorable graphs;Alekseev;Discrete Math.,2003
4. On the P4-structure of graphs;Babel,1997
5. C. Berge, Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe (1961) 114–115.