Matroids with nine elements

Journal of Combinatorial Theory. Series B

Volumn 98, Issue 2, 2008, Pages 415-431

  Mayhew, Dillon ^a   Royle, Gordon F ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Combinatorial geometry; Extension; Matroid; Orderly algorithm

Indexed keywords

EID: 38949212129     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2007.07.005     Document Type: Article

References (15)

1. D. Acketa, The catalogue of all nonisomorphic matroids on at most 8 elements, vol. 1 of Special Issue, University of Novi Sad Institute of Mathematics Faculty of Science, Novi Sad, 1983
2. Blackburn J.E., Crapo H.H., and Higgs D.A. A catalogue of combinatorial geometries. Math. Comp. 27 (1973) 155-166 addendum
3. Blackburn J.E., Crapo H.H., and Higgs D.A. A catalogue of combinatorial geometries. Math. Comp. 27 (1973) No. 121, loose microfiche suppl. A12-G12
4. Brualdi R.A., and Dinolt G.W. Characterizations of transversal matroids and their presentations. J. Combin. Theory Ser. B 12 (1972) 268-286
5. Crapo H.H. Single-element extensions of matroids. J. Res. Nat. Bur. Standards Sect. B 69B (1965) 55-65
6. Dukes W.M.B. On the number of matroids on a finite set. Sém. Lothar. Combin. 51 (2004/2005) Art. B51g, 12 pp. (electronic)
7. McKay B.D. Practical graph isomorphism. in: Proceedings of the Tenth Manitoba Conference on Numerical Mathematics and Computing, Vol. I (Winnipeg, MB, 1980), vol. 30, 1981. URL. http://cs.anu.edu.au/~bdm/nauty/PGI/
8. McKay B.D. Isomorph-free exhaustive generation. J. Algorithms 26 2 (1998) 306-324
9. Oxley J.G. Matroid Theory. Oxford Sci. Publ. (1992), The Clarendon Press, Oxford Univ. Press, New York
10. Read R.C. Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. Ann. Discrete Math. 2 (1978) 107-120 Algorithmic aspects of combinatorics (Conf., Vancouver Island, BC, 1976)
11. Royle G.F. An orderly algorithm and some applications in finite geometry. Discrete Math. 185 1-3 (1998) 105-115
12. Sloane N.J.A. The On-Line Encylopaedia of Integer Sequences. URL. http://www.research.att.com/~njas/sequences
13. Welsh D.J.A. Combinatorial problems in matroid theory. Combinatorial Mathematics and Its Applications, Proc. Conf. Oxford, 1969 (1971), Academic Press, London 291-306
14. Welsh D.J.A. Matroid Theory. London Math. Soc. Monogr. vol. 8 (1976), Academic Press [Harcourt Brace Jovanovich Publishers], London
15. Whittle G. Recent work in matroid representation theory. Discrete Math. 302 1-3 (2005) 285-296