1. A. Ben Rebea, Etude des stables dans les graphes quasi-adjoints, Ph.D. Thesis, Univ. of Grenoble, 1981
2. The structure of claw-free graphs;Chudnovsky,2005
3. Maximum matching and a polyhedron with (0,1) vertices;Edmonds;Journal of Research of the National Bureau of Standards,1965
4. Circular one matrices and the stable set polytope of quasi-line graphs;Eisenbrand;Lecture Notes in Computer Science,2005
5. The rank facets of the stable set polytope for claw-free graphs;Galluccio;Journal of Combinatorial Theory Series B,1997