1. Matroids, graphs, and 3-connectivity;Bixby,1979
2. W.H. Cunningham, A combinatorial decomposition theory, Ph.D. Thesis, University of Waterloo, 1973.
3. A.K. Kelmans, The concepts of a vertex in a matroid, the non-separating circuits and a new criterion for graph planarity, in: Algebraic Methods in Graph Theory, vol. 1, Colloquia Mathematics Society János Bolyai, vol. 25, Szeged, Hungary, 1978, North-Holland, Amsterdam, 1981, pp. 345–388.
4. A.K. Kelmans, Graph planarity and related topics, in: N. Robertson, P.D. Seymour (Eds.), Graph Structure Theory, Contemporary Mathematics, vol. 147, 1991, pp. 635–667.
5. Non-separating cocircuits in binary matroids;Lemos;Linear Algebra Appl.,2004