1. Aggregation of inequalities in integer programming;Chvátal;Ann. Discrete Math.,1977
2. Covering the cliques of a graph with vertices;Erdős;Discrete Math.,1992
3. S. Földes and P.L. Hammer, Split graphs, in: F. Hoffman eds. Proc. 8th South-eastern Conf. on Combinatories, Graph Theory and Computing (Louisiana State University, Baton Rouge, Louisiana);
4. Problems from the world surrounding perfect graphs;Gyárfás;Zastosow. Mat.,1987