DOIAbstract
AbstractThe connectivity of a graph G and the corank of a matroid M are denoted by κ(G) and ϱ, respectively. It is shown that if a graph G is the base graph of a simple matroid M, then κ(G)⩾2ϱ and the lower bound of 2ϱ is best possible
AbstractThe connectivity of a graph G and the corank of a matroid M are denoted by κ(G) and ϱ, respectively. It is shown that if a graph G is the base graph of a simple matroid M, then κ(G)⩾2ϱ and the lower bound of 2ϱ is best possible
AbstractFor a graph G with at least one edge, define d(G) = |E(G)||V(G)| and m(G) = maxH ⊆ G d(H). K...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
AbstractThe connectivity of a graph G and the corank of a matroid M are denoted by κ(G) and ϱ, respe...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
AbstractIf M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
In this paper we derive several results for connected matroids and use these to obtain new results f...
AbstractDirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected gra...
AbstractThis paper discusses a certain graph, called the “dependence graph” (“the DPG”), that can be...
La notion de connexité est fondamentale en théorie des graphes. Nous proposons une étude approfondie...
AbstractThe connectivity function k of a matroid M on a set E is defined by k(X) = r(X) + r(E − X) −...
AbstractA matroid may be defined as a collection of sets, called bases, which satisfy a certain exch...
A special case of a theorem of Turán is that a graph on v vertices, with no loops, parallel edges, o...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
AbstractFor a graph G with at least one edge, define d(G) = |E(G)||V(G)| and m(G) = maxH ⊆ G d(H). K...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
AbstractThe connectivity of a graph G and the corank of a matroid M are denoted by κ(G) and ϱ, respe...
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and ...
AbstractIf M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
In this paper we derive several results for connected matroids and use these to obtain new results f...
AbstractDirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected gra...
AbstractThis paper discusses a certain graph, called the “dependence graph” (“the DPG”), that can be...
La notion de connexité est fondamentale en théorie des graphes. Nous proposons une étude approfondie...
AbstractThe connectivity function k of a matroid M on a set E is defined by k(X) = r(X) + r(E − X) −...
AbstractA matroid may be defined as a collection of sets, called bases, which satisfy a certain exch...
A special case of a theorem of Turán is that a graph on v vertices, with no loops, parallel edges, o...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
AbstractFor a graph G with at least one edge, define d(G) = |E(G)||V(G)| and m(G) = maxH ⊆ G d(H). K...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
Add to ORKG