Constructing internally 4-connected binary matroids

In an earlier paper, we proved that an internally 4-connected binary matroid with at least seven elements contains an internally 4-connected proper minor that is at most six elements smaller. We refine this result, by giving detailed descriptions of the operations required to produce the internally 4-connected minor. Each of these operations is top-down, in that it produces a smaller minor from the original. We also describe each as a bottom-up operation, constructing a larger matroid from the original, and we give necessary and sufficient conditions for each of these bottom-up moves to produce an internally 4-connected binary matroid. From this, we derive a constructive method for generating all internally 4-connected binary matroids.

[1]  Xiangqian Zhou,et al.  Generating weakly 4-connected matroids , 2008, J. Comb. Theory, Ser. B.

[2]  Sandra R. Kingan,et al.  A generalization of a graph result of D. W. Hall , 1997, Discret. Math..

[3]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[4]  James G. Oxley,et al.  The regular matroids with no 5-wheel minor , 1989, J. Comb. Theory, Ser. B.

[5]  W. T. Tutte.  Connectivity in Matroids , 1966, Canadian Journal of Mathematics.

[6]  Xiangqian Zhou,et al.  On internally 4-connected non-regular binary matroids , 2004, J. Comb. Theory, Ser. B.

[7]  Dillon Mayhew,et al.  A chain theorem for internally 4-connected binary matroids , 2011, J. Comb. Theory, Ser. B.

[8]  Xiangqian Zhou,et al.  The class of binary matroids with no M(K3, 3)-, M ast (K3, 3)-, M(K5)- or M ast (K5)-minor , 2004, J. Comb. Theory, Ser. B.