1. A characterization of almost-planar graphs;Gubser;Combin. Probab. Comput.,1996
2. An extension of Lindström's result about characteristic sets of matroids;Lemos;Discrete Math.,1988
3. Binary matroids without prisms, prism duals, and cubes;Kingan;Discrete Math.,1996
4. A. D. Mills, Matroids that are almost series-parallel networks, in, Proceedings of the Twenty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, 1996, Congressus Numer., 119, (1996), 161–172.
5. The binary matroids with no 4-wheel minor;Oxley;Trans. Amer. Math. Soc.,1987