On minor-minimally 3-connected binary matroids |
| |
| Authors: | Loni Delaplane Haidong Wu |
| |
| Institution: | a Department of Mathematics, The University of Mississippi, University, MS 38677, United States
b Department of Mathematics and Statistics, Wright State University, Dayton, OH 45435, United States |
| |
| Abstract: | A matroid M is called minor-minimally 3-connected if M is 3-connected and, for each e∈E(M), either M?e or M/e is not 3-connected. In this paper, we prove a chain theorem for the class of minor-minimally 3-connected binary matroids. As a consequence, we obtain a chain theorem for the class of minor-minimally 3-connected graphs. |
| |
| Keywords: | Binary matroids Chain theorem Minor-minimally 3-connected |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
