1. C. Berge, “Färbung von Graphen, deren sämtliche bzw deren ungerade Kreise starr sind (Zusammenfassung),”Wiss. Z. Martin-Luther-Univ. Halle Wittenberg Math. Natur. Reihe (1961) 114.
2. C. Berge, “Some classes of perfect graphs,” in:Graph theory and theoretical physics, Ed. F. Harary (Academic Press, New York, 1967).
3. C. Berge, “The rank of a family of sets and some applications to graph theory,” in:Recent progress in combinatorics, Ed. W.T. Tutte (Academic Press, New York, 1969).
4. R.P. Dilworth, “A decomposition theorem for partially ordered sets,”Annals of Mathematics 51 (1950) 161.
5. R.J. Duffin, “The extremal length of a network,”J. Math. Anal. Appl. 5 (1962) 200.