AbstractIt is well known that for any element of a connected matroid, either the deletion or the contraction of that element preserves connectivity. We prove a simple and natural generalization to 3-connected matroids. This result is used to prove Seymour's generalization of a theorem of Kelmans
AbstractA standard matrix representation A of a matroid M represents M relative to a fixed basis B. ...
The classical tool at the matroid theorist’s disposal when dealing with the common problem of wantin...
Tutte proved that if e is an element of a 3-connected matroid M such that neither M\e nor M/e is 3-c...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
A standard matrix representation A of a matroid M represents M relative to a fixed basis B. Deleting...
An essential element of a 3-connected matroid M is one for which neither the deletion nor the contra...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
A standard matrix representation A of a matroid M represents M relative to a fixed basis B. Deleting...
We show that for any 3-connected matroid M on a ground set of at least four elements such that M doe...
For a k-connected graph or matroid M, where k is a fixed positive integer, we say that a subset X of...
AbstractA 3-separation (A, B), in a matroid M, is called sequential if the elements of A can be orde...
AbstractA standard matrix representation A of a matroid M represents M relative to a fixed basis B. ...
The classical tool at the matroid theorist’s disposal when dealing with the common problem of wantin...
Tutte proved that if e is an element of a 3-connected matroid M such that neither M\e nor M/e is 3-c...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
A standard matrix representation A of a matroid M represents M relative to a fixed basis B. Deleting...
An essential element of a 3-connected matroid M is one for which neither the deletion nor the contra...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
A standard matrix representation A of a matroid M represents M relative to a fixed basis B. Deleting...
We show that for any 3-connected matroid M on a ground set of at least four elements such that M doe...
For a k-connected graph or matroid M, where k is a fixed positive integer, we say that a subset X of...
AbstractA 3-separation (A, B), in a matroid M, is called sequential if the elements of A can be orde...
AbstractA standard matrix representation A of a matroid M represents M relative to a fixed basis B. ...
The classical tool at the matroid theorist’s disposal when dealing with the common problem of wantin...
Tutte proved that if e is an element of a 3-connected matroid M such that neither M\e nor M/e is 3-c...
DOI
Add to ORKG