S. Bianchi, M. Escalante, G. Nasini, and L. Tunçel, Lovász-Schrijver PSDoperator and a superclass of near-perfect graphs, Electronic Notes in Discrete Math, vol.44, pp.339-344, 2013.

S. Bianchi, M. Escalante, G. Nasini, and A. Wagler, Lovász-Schrijver PSDoperator on claw-free graphs, Combinatorial Optimization (ISCO 2016), pp.59-70, 2016.

Z. Blázsik, M. Hujter, A. Pluhár, and Z. Tuza, Graphs with no induced C4 and 2K2, Discrete Math, vol.115, pp.51-55, 1993.

V. Boncompagni, I. Penev, and K. Vu¸skovi´cvu¸skovi´vu¸skovi´c, Clique-cutsets beyond chordal graphs

M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Annals of Mathematics, vol.164, pp.51-229, 2006.

V. , Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math, vol.4, pp.305-337, 1973.

V. , On certain polytopes associated with graphs, J. Combin. Theory (B), vol.18, pp.138-154, 1975.

V. Chvátal and P. L. Hammer, Aggregation of inequalities in integer programming, Annals of Discrete Math, vol.1, pp.145-162, 1977.

M. Conforti, G. Cornuéjols, A. Kapoor, and K. Vu¸skovi´cvu¸skovi´vu¸skovi´c, Universally signable graphs, Combinatorica, vol.17, pp.67-77, 1997.

S. Coulonges, A. Pêcher, and A. Wagler, Characterizing and bounding the imperfection ratio for some classes of graphs, Math. Progr. A, vol.118, pp.37-46, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00308150

G. A. Dirac, On rigid circuit graphs, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol.25, pp.71-76, 1961.

M. Escalante and G. Nasini, Lovász and Schrijver N+-relaxation on web graphs, Lecture Notes in Computer Sciences, vol.8596, pp.221-229, 2014.

M. Escalante, G. Nasini, and A. Wagler, Characterizing N+-perfect line graphs, International Transactions in Operational Research, vol.24, pp.325-337, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02047314

S. Földes and P. Hammer, Split graphs having Dilworth number two, Canadian Journal of Mathematics, vol.29, pp.666-672, 1977.

L. Lipták and L. Tunçel, Stable set problem and the lift-and-project ranks of graphs, Math. Programming A, vol.98, pp.319-353, 2003.

L. Lovász and A. Schrijver, Cones of matrices and set-functions and 0-1 optimization, SIAM J. on Optimization, vol.1, pp.166-190, 1991.

F. B. Shepherd, Applying Lehman's theorem to packing problems, Mathematical Programming, vol.71, pp.353-367, 1995.

K. Truemper, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, Journal of Combin. Theory B, vol.32, pp.112-139, 1982.

A. Wagler, Antiwebs are rank-perfect, vol.4, pp.149-152, 2004.