On maximal independent sets of vertices in claw-free graphs

Beineke, 1969, A survey of packings and coverings in graphs, 45

Berge, 1957, Two theorems in graph theory, 43, 842

Berge, 1973

Berge, 1970

Bose, 1963, Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math., 13, 389, 10.2140/pjm.1963.13.389

Busacker, 1965

Charnes, 1953

Edmonds, 1965, Paths, trees, and flowers, Canad. J. Math., 17, 449, 10.4153/CJM-1965-045-4

J. Edmonds and W. Pulleyblank, “Optimum Matchings,” Johns Hopkins Univ. Press, Baltimore, Md., in press.

Edmonds, 1965, Maximum matching and a polyhedron with 0, 1-vertices, J. Res. Nat. Bur. Standards Sect. B, 69, 125, 10.6028/jres.069B.013

Gilmore, 1964, A characterization of comparability graphs, Canad. J. Math., 16, 539, 10.4153/CJM-1964-055-5

Harary, 1953, On the notion of balance in a signed graph, Michigan Math. J., 2, 143, 10.1307/mmj/1028989917

Lawler, 1976

Ore, 1962

N. Sbihi, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile, Discrete Math., in press.

van Rooij, 1965, The interchange graph of a finite graph, Acta Math. Acad. Sci. Hungar., 16, 263, 10.1007/BF01904834