AbstractDirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected graph G has at least ((n–1)|V(G)|–2n)/(2n–1) vertices of degree n. This paper determines the graphs which are extremal with respect to these two results and, in addition, establishes a similar extremal result for minimally connected matroids
The edge-connectivity l of a connected graph is the minimum number of edges whose deletion produc...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
Dirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected graph G has...
AbstractDirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected gra...
AbstractThe degree distance of a connected graph, introduced by Dobrynin, Kochetova and Gutman, has ...
In this paper we derive several results for connected matroids and use these to obtain new results f...
AbstractA graph G is (n, λ)-connected if it satisfies the following conditions: (1) |V(G)|⩾n+1; (2) ...
In this paper, we study connected plane graphs with link component number equal to the nullity and c...
AbstractDing, Oporowski, Oxley, and Vertigan proved that, for alln⩾3, there is an integerN(n) such t...
AbstractThis paper deals with two conjectures made by Dobrynin and Kochetova on the minimum and maxi...
AbstractIn this paper, we study connected plane graphs with link component number equal to the nulli...
AbstractIf M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then...
AbstractThe connectivity of a graph G and the corank of a matroid M are denoted by κ(G) and ϱ, respe...
AbstractWe give a lower bound on the number of edges meeting some vertex of degree k in terms of the...
The edge-connectivity l of a connected graph is the minimum number of edges whose deletion produc...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
Dirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected graph G has...
AbstractDirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected gra...
AbstractThe degree distance of a connected graph, introduced by Dobrynin, Kochetova and Gutman, has ...
In this paper we derive several results for connected matroids and use these to obtain new results f...
AbstractA graph G is (n, λ)-connected if it satisfies the following conditions: (1) |V(G)|⩾n+1; (2) ...
In this paper, we study connected plane graphs with link component number equal to the nullity and c...
AbstractDing, Oporowski, Oxley, and Vertigan proved that, for alln⩾3, there is an integerN(n) such t...
AbstractThis paper deals with two conjectures made by Dobrynin and Kochetova on the minimum and maxi...
AbstractIn this paper, we study connected plane graphs with link component number equal to the nulli...
AbstractIf M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then...
AbstractThe connectivity of a graph G and the corank of a matroid M are denoted by κ(G) and ϱ, respe...
AbstractWe give a lower bound on the number of edges meeting some vertex of degree k in terms of the...
The edge-connectivity l of a connected graph is the minimum number of edges whose deletion produc...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
DOI
Add to ORKG