Add to ORKGFor 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 3connected binary matroid to have a 3-removable circuit
A standard matrix representation A of a matroid M represents M relative to a fixed basis B. Deleting...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
This paper generalizes a theorem of Dirac for graphs by proving that if M is a 3-connected matroid, ...
AbstractFor a k-connected graph or matroid M, where k is a fixed positive integer, we say that a sub...
We show that if M is a connected binary matroid of cogirth at least five which does not have both an...
AbstractThis paper proves several extremal results for 3-connected matroids. In particular, it is sh...
This paper proves several extremal results for 3-connected matroids. In particular, it is shown that...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravar...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
AbstractA collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected m...
AbstractIn this paper, we prove a conjecture proposed by Leo: a large minimally 3-connected matroid ...
A standard matrix representation A of a matroid M represents M relative to a fixed basis B. Deleting...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
This paper generalizes a theorem of Dirac for graphs by proving that if M is a 3-connected matroid, ...
AbstractFor a k-connected graph or matroid M, where k is a fixed positive integer, we say that a sub...
We show that if M is a connected binary matroid of cogirth at least five which does not have both an...
AbstractThis paper proves several extremal results for 3-connected matroids. In particular, it is sh...
This paper proves several extremal results for 3-connected matroids. In particular, it is shown that...
We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such th...
Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravar...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
AbstractA collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected m...
AbstractIn this paper, we prove a conjecture proposed by Leo: a large minimally 3-connected matroid ...
A standard matrix representation A of a matroid M represents M relative to a fixed basis B. Deleting...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
This paper generalizes a theorem of Dirac for graphs by proving that if M is a 3-connected matroid, ...