Add to ORKGThis paper generalizes a theorem of Dirac for graphs by proving that if M is a 3-connected matroid, then, for all pairs {a, b} of distinct elements of M and all cocircuits C* of M, there is a circuit that contains {a, b} and meets C*. It is also shown that, although the converse of this result fails, the specified condition can be used to characterize 3-connected matroids
Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
Seymour has shown that a matroid has a triad, that is, a 3-element set which is the intersection of ...
AbstractIn this paper, we give a generalization of a well-known result of Dirac that given any k ver...
AbstractLet M be a connected binary matroid having no F7∗-minor. Let A∗ be a collection of cocircuit...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravar...
AbstractA collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected m...
In this paper we derive several results for connected matroids and use these to obtain new results f...
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...
AbstractIn this paper we answer a question of Oxley. We will show that if M is a 3-connected matroid...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractIn the circuit graph of a matroid the vertices are the circuits and the edges are the pairs ...
Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
Seymour has shown that a matroid has a triad, that is, a 3-element set which is the intersection of ...
AbstractIn this paper, we give a generalization of a well-known result of Dirac that given any k ver...
AbstractLet M be a connected binary matroid having no F7∗-minor. Let A∗ be a collection of cocircuit...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravar...
AbstractA collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected m...
In this paper we derive several results for connected matroids and use these to obtain new results f...
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...
AbstractIn this paper we answer a question of Oxley. We will show that if M is a 3-connected matroid...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractIn the circuit graph of a matroid the vertices are the circuits and the edges are the pairs ...
Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
Seymour has shown that a matroid has a triad, that is, a 3-element set which is the intersection of ...