| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649835 | Discrete Mathematics | 2009 | 6 Pages |
Abstract
A matroid MM is called minor-minimally 3-connected if MM is 3-connected and, for each e∈E(M)e∈E(M), either M∖eM∖e or M/eM/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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Loni Delaplane, Talmage J. Reid, Haidong Wu, Xiangqian Zhou,