1. A simple theorem on 3-connectivity;Bixby;Linear Algebra Appl.,1982
2. Matroids, graphs, and 3-connectivity;Bixby,1979
3. W.H. Cunningham, A Combinatorial Decomposition Theory, Ph.D. Thesis, University of Waterloo, 1973.
4. Unavoidable minors of large 3-connected binary matroids;Ding;J. Combin. Theory Ser. B,1996
5. 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, Colloq. Math. Soc. János Bolyai, vol. 25, Szeged, Hungary, 1978, North Holland, Amsterdam, 1981, pp. 345–388.