1. Courcelle, B.: Graph rewriting: An algebraic and logical approach. In: van Leeuwnen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, North-Holland, Amsterdam (1990)
2. Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15, 948–957 (1986)
3. A series of books in the mathematical sciences;M.R. Garey,1979
4. Hliněný, P.: Branch-width, parse trees and monadic second-order logic for matroids. Manuscript (2002)
5. Lueker, G.S.: Two NP-complete problems in non-negative integer programming. Report No. 178, Department of Computer Science, Princeton University, Princeton, N.J. (1975)