Add to ORKGA unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, Oxley and Wagner
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
We characterize the 3-connected members of the intersection of the class of bicircular and cobi- cir...
Young in his paper titled, Matroid Designs in 1973, reports that Murty in his paper titled, Equicard...
AbstractTutte has defined n-connection for matroids and proved a connected graph is n-connected if a...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
Matroids designs are defined to be matroids in which the hyperplanes all have the same size. The dua...
We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte conn...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
If M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then one eas...
Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say tha...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
In this paper we derive several results for connected matroids and use these to obtain new results f...
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that th...
AbstractWe discuss the relationship between the vertical connectivity of a biased graph Ω and the Tu...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
We characterize the 3-connected members of the intersection of the class of bicircular and cobi- cir...
Young in his paper titled, Matroid Designs in 1973, reports that Murty in his paper titled, Equicard...
AbstractTutte has defined n-connection for matroids and proved a connected graph is n-connected if a...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
Matroids designs are defined to be matroids in which the hyperplanes all have the same size. The dua...
We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte conn...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
If M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then one eas...
Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say tha...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
In this paper we derive several results for connected matroids and use these to obtain new results f...
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that th...
AbstractWe discuss the relationship between the vertical connectivity of a biased graph Ω and the Tu...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
We characterize the 3-connected members of the intersection of the class of bicircular and cobi- cir...
Young in his paper titled, Matroid Designs in 1973, reports that Murty in his paper titled, Equicard...