1. 1. BERGE C., Graphes et hypergraphes, Dunod, Paris, 1970.3571730213.25702
2. 2. CRAPO H. et ROTA G., On the Foundations of Combinatorial Theory : Combinatorial Geometries, M.I.T. Press, Cambridge, 1970.2909800216.02101
3. 3. EDMONDS J., Matroids and the Greedy Algorithm, Mathematical Programming, vol. 1, n° 2, novembre 1971, p. 127-136.2973570253.90027
4. 4. EDMONDS J., Submodular Functions, Matroids, and Certain Polyhedra, Combinatorial Structures and their Applications, Gordon and Breach, Calgary International Conference, juin 1969, p. 69-87.2709450268.05019
5. 5. GALE D., Optimal Assignments in an Ordered Set : an Application of Matroïd Theory, Combinatorial Theory, vol. 4, 1968, p. 176-180.2270390197.00803