This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T.H. Brylawski, A decomposition for combinatorial geometries, Trans. Amer. Math. Soc. 171 (1972), 235–282.
J.E. Dawson, A note on some algorithms for matroids, J. Math. Anal. Appl. 75 (1980), 611–615.
J.E. Dawson, A construction for a family of sets and its application to matroids, Combinatorial Mathematics VIII, Lecture Notes in Math. 884 (Springer-Verlag, Berlin, 1981), 136–147.
J.E. Dawson, A simple approach to some basic results in matroid theory, J. Math. Anal. Appl. to appear.
B. Hull, Two algorithms for matroids, Discrete Math. 13 (1975), 121–128.
E. Minieka, Finding the circuits of a matroid, J. Res. Nat. Bur. Standards 80B (1976), 337–342.
C.A.B. Smith, On Tutte's dichromate polynomial, Annals of Discrete Math. 3 (1978), 247–257.
R. von Randow, Introduction to the Theory of Matroids, Lecture Notes in Economics and Mathematical Systems No. 109, (Springer-Verlag, Berlin, 1975).
D.J.A. Welsh, Matroid Theory (Academic Press, New York, 1976).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag
About this paper
Cite this paper
Dawson, J.E. (1982). Matroid bases, opposite families and some related algorithms. In: Billington, E.J., Oates-Williams, S., Street, A.P. (eds) Combinatorial Mathematics IX. Lecture Notes in Mathematics, vol 952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0061981
Download citation
DOI: https://doi.org/10.1007/BFb0061981
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11601-1
Online ISBN: 978-3-540-39375-7
eBook Packages: Springer Book Archive