Publisher
Springer Berlin Heidelberg
Reference78 articles.
1. Aho, A.V., Hopcroft, J.E. & Ullmann, J.D. The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Mass. (1974).
2. Appel, K. & Haken, W., Every planar map is four colourable, Bull. Amer. Math. Soc. 82 (1976), 711–712.
3. Birkoff, G., Lattice Theory, A.M.S. Colloq. Publ. 25 (1967).
4. Bixby, R.E., Kuratowski's and Wagner's theorems for matroids J. Combinatorial Theory 22 (1977), 31–53.
5. Bixby, R.E., On Reid's characterisation of the matroids representable over GF(3), J. Combinatorial Theory B26 (1979), 174–205.