Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile

Berge, 1973

Boulala, 1978, Polytope des stables d'un graphe série-paralléle

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

Edmonds, 1965, Maximum matching and a polyhedron with (0, 1) vertices, J. Res. Bureau Stand., 65 B, 125

Fulkerson, 1969, Blocking polyhedra

Georges J. Minty, On maximal independent sets of vertices in claw-free graphs. Indiana University (à paraître).

Parthasarathy, 1976, The strong perfect-graph conjecture is true for K1, 3ωfree graphs, J. Combinatorial Theory (B), 21, 212, 10.1016/S0095-8956(76)80005-6

Sbihi, 1978