Title of article
Removing circuits in 3-connected binary matroids
Author/Authors
Cordovil، نويسنده , , Raul and Junior، نويسنده , , Brلulio Maia and Lemos، نويسنده , , Manoel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
11
From page
655
To page
665
Abstract
For a k -connected graph or matroid M , where k is a fixed positive integer, we say that a subset X of E ( M ) is k -removable provided M ∖ X is k -connected. In this paper, we obtain a sharp condition on the size of a 3-connected binary matroid to have a 3-removable circuit.
Keywords
Matroid , Binary matroid , 3-Connected matroid , Circuit , removable circuit
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598528
Link To Document