1. Bixby, R.E., Cunningham, W.H.: Matroids, graphs, and 3-connectivity. In: Bondy, J.A., Murty, U.S.R. (eds.) Graph Theory and Related Topics, pp. 91–103. Academic Press, New York (1979)
2. Kelmans, A.K.: The concept of a vertex in a matroid, the nonseparating cycles of a graph and a new criterion for graph planarity. In: Lovász, L., Sós, V.T. (eds.) Algebraic Methods in Graph Theory, Vol. 1. Colloq. Math. Soc. János Bolyai, Vol. 25, pp. 345–388. North Holland, Amsterdam (1981)
3. Kelmans, A.K.: Graph planarity and related topics. In: Robertson, N., Seymour, P.D. (eds.) Graph Structure Theory. Contemp. Math., Vol. 147, pp. 635–667. Amer. Math. Soc., Providence (1991)
4. Lemos M.: On 3-connected matroids. Discrete Math. 73(3), 273–283 (1989)
5. Lemos M.: Non-separating cocircuits in binary matroids. Linear Algebra Appl. 382, 171–178 (2004)