Defining matroids through sequential selection

European Journal of Combinatorics

Volumn 28, Issue 1, 2007, Pages 469-480

  Jones, Scott ^a   McGuinness, Sean ^b  

^a MILLIMAN INC   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749131474     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2004.11.006     Document Type: Article

References (8)

1. Bollobás B. Modern Graph Theory (1998), Springer, New York
2. T. Brylawski, Private communication, 2002
3. Dawson J.E. A simple approach to some basic results in matroid theory. J. Math. Anal. Appl. 84 (1981) 555-559
4. Edmonds J., and Fulkerson D.R. Transversals and matroid partition. J. Nat. Bureau Stand. B 69 (1965) 147-153
5. S. Jones, Operations on graphs and matroids, Masters Thesis, The University of Montana, 2002
6. Oxley J. Matroid Theory (1992), Oxford Press
7. Welsh D. Matroid Theory (1976), Academic Press
8. West D.B. Introduction to Graph Theory. 2nd ed. (2001), Prentice-Hall, Upper Saddle River, NJ