1. R. E. Bixby andW. H. Cunningham, Converting linear programs to network problems,Math. Operations Res., to appear.
2. D. A. Higgs, Strong maps of geometries,J. Combinatorial Theory 5 (1968), 185–191.
3. P. M. Jensen andB. Korte, Complexity of matroid property algorithms,Univ. of Bonn Tech. Report No. 78124-0R
4. L. Lovász, The matroid matching problem, inAlgebraic Methods in Graph Theory, Proc. Coll. Math. Soc. J. Bolyai, North-Holland 1980.
5. G. C. Robinson andD. J. A. Welsh, The computational complexity of matroid properties,to appear.