AbstractThe following result is proved: Every finite n-connected graph G contains either a vertex of valency n or an edge e such that the graph arising from G by the deletion of e remains n-connected
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
AbstractA graph G is locally n-connected (locally n-edge connected) if the neighborhood of each vert...
A. Frank (Problem session of the Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975) c...
AbstractThe following result is proved: Every finite n-connected graph G contains either a vertex of...
AbstractFor a graph G, we can consider the minimum number of vertices (resp. edges) whose deletion d...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
Let G be a connected graph with p ≥ 2 vertices. For k = 1, 2, ..., P-1, the Kth order edge-connectiv...
AbstractThe connected cutset connectivity (connected edge-cutset connectivity) of a nontrivial conne...
AbstractA. Frank (Problem session of the Fifth British Combinatorial Conference, Aberdeen, Scotland,...
AbstractA connected graph G can be disconnected or reduced to a single vertex by removing an appropr...
AbstractWe call a graph G (k,n)-path-connected iff for any subset A of the vertex set of G with card...
AbstractFor a connected graph G=(V,E), a subset U⊆V is called a disconnected cut if U disconnects th...
AbstractGiven n and i, n > 2, 2 ≤ i ≤ n − 1, the smallest size of an n-graph without endvertices is ...
AbstractThe old well-known result of Chartrand, Kaugars and Lick says that every k-connected graph G...
AbstractThe path-connectivity of a graph G is the maximal k for which between any k pairs of vertice...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
AbstractA graph G is locally n-connected (locally n-edge connected) if the neighborhood of each vert...
A. Frank (Problem session of the Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975) c...
AbstractThe following result is proved: Every finite n-connected graph G contains either a vertex of...
AbstractFor a graph G, we can consider the minimum number of vertices (resp. edges) whose deletion d...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
Let G be a connected graph with p ≥ 2 vertices. For k = 1, 2, ..., P-1, the Kth order edge-connectiv...
AbstractThe connected cutset connectivity (connected edge-cutset connectivity) of a nontrivial conne...
AbstractA. Frank (Problem session of the Fifth British Combinatorial Conference, Aberdeen, Scotland,...
AbstractA connected graph G can be disconnected or reduced to a single vertex by removing an appropr...
AbstractWe call a graph G (k,n)-path-connected iff for any subset A of the vertex set of G with card...
AbstractFor a connected graph G=(V,E), a subset U⊆V is called a disconnected cut if U disconnects th...
AbstractGiven n and i, n > 2, 2 ≤ i ≤ n − 1, the smallest size of an n-graph without endvertices is ...
AbstractThe old well-known result of Chartrand, Kaugars and Lick says that every k-connected graph G...
AbstractThe path-connectivity of a graph G is the maximal k for which between any k pairs of vertice...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
AbstractA graph G is locally n-connected (locally n-edge connected) if the neighborhood of each vert...
A. Frank (Problem session of the Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975) c...
DOI
Add to ORKG