C. Berge, Sur le couplage maximum d'un graphe, C. R. Acad. Sci. Paris, vol.247, pp.258-259, 1958.

A. Björner and L. Lovász, Pseudomodular lattices and continuous matroids, Acta Sci. Math. (Szeged), vol.51, issue.3-4, pp.295-308, 1987.

A. Dress and L. Lovász, On some combinatorial properties of algebraic matroids, Combinatorica, vol.28, issue.1, pp.39-48, 1987.
DOI : 10.1007/BF02579199

W. Hochstättler and W. Kern, Matroid matching in pseudomodular lattices, Combinatorica, vol.7, issue.2, pp.145-152, 1989.
DOI : 10.1007/BF02124676

B. Jackson and T. Jordán, The d-dimensional rigidity matroid of sparse graphs, Journal of Combinatorial Theory, Series B, vol.95, issue.1
DOI : 10.1016/j.jctb.2005.03.004

P. M. Jensen and B. Korte, Complexity of Matroid Property Algorithms, SIAM Journal on Computing, vol.11, issue.1, pp.184-190, 1982.
DOI : 10.1137/0211014

G. Laman, On graphs and rigidity of plane skeletal structures, Journal of Engineering Mathematics, vol.4, issue.4, pp.331-340, 1970.
DOI : 10.1007/BF01534980

L. Lovász, Matroid matching and some applications, Journal of Combinatorial Theory, Series B, vol.28, issue.2, pp.208-236, 1980.
DOI : 10.1016/0095-8956(80)90066-0

L. Lovász, Selecting independent lines from a family of lines in a space, Acta Sci. Math. (Szeged), vol.42, issue.12, pp.121-131, 1980.

L. Lovász, The matroid matching problem, Algebraic methods in graph theory, pp.495-517, 1978.

A. Schrijver, Combinatorial optimization, Polyhedra and efficiency. Algorithms and Combinatorics, vol.24, pp.70-83, 2003.

P. Tong, E. L. Lawler, and V. V. Vazirani, Solving the Weighted Parity Problem for Gammoids by Reduction to Graphic Matching, Progress in combinatorial optimization, pp.363-374, 1982.
DOI : 10.1016/B978-0-12-566780-7.50026-X