Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Beineke, L.W.: Characterizations of derived graphs. J. Combinatorial Theory 9, 129–135 (1970)
2. Berge, C.: Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 10:114 (1961) 88
3. Berge, C., Chvátal, V. (eds.): Topics on perfect graphs. North-Holland, Amsterdam (1984)
4. Boliac, R., Lozin, V.V.: On the clique-width of graphs in hereditary classes, Proceedings of ISAAC 2002, Lecture Notes in Computer Science 2518 (2002), pp. 44–54
5. Brandstädt, A., Engelfriet, J., Le, H.O., Lozin, V.V.: Clique-width for 4-vertex forbidden sugraphs. Theory Comput. Syst. 39, 561–590 (2006)