Title of article
On minor-minimally 3-connected binary matroids
Author/Authors
Delaplane، نويسنده , , Loni and Reid، نويسنده , , Talmage J. and Wu، نويسنده , , Haidong and Zhou، نويسنده , , Xiangqian، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
6
From page
3249
To page
3254
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
Minor-minimally 3-connected , Binary matroids , Chain theorem
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598816
Link To Document