AbstractA connected graph is λp,q-connected if there is a set of edges whose deletion leaves two components of order at least p and q, respectively. In this paper we present some sufficient conditions for graphs to be λp,q-connected. Furthermore, we study λ2,q-connected graphs in more detail
In this note we show that every connected graph G of order >> 3 has two distinct vertices u and v s...
AbstractIf instead of removing only vertices from a graph, one removes entire closed neighbourhoods ...
Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (suffic...
AbstractA connected graph is λp,q-connected if there is a set of edges whose deletion leaves two com...
In this paper we show that for any two vertices x, y of a 6-connected graph G, there exists a path b...
A graph is said to be p-connected if for every partition of its vertices into two non-empty, disjoin...
Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-conne...
AbstractFor a connected graph G, an edge set S is a k-restricted edge-cut if G−S is disconnected and...
AbstractThe connected cutset connectivity (connected edge-cutset connectivity) of a nontrivial conne...
Let k be a positive integer. A graph G = (V,E) is said to be a k - connected graph if for any given ...
AbstractA graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph...
We prove a necessary and sufficient condition under which a connected graph has a connected P₃-path ...
L. Dubins conjectured in 1984 that the graph on vertices {1, 2, 3, ...} where an edge is drawn betwe...
AbstractIf the monochromatic graphs G1 and G2 in a 2-edge-coloured complete graph Km (m⩾6) are conne...
The edge-connectivity l of a connected graph is the minimum number of edges whose deletion produc...
In this note we show that every connected graph G of order >> 3 has two distinct vertices u and v s...
AbstractIf instead of removing only vertices from a graph, one removes entire closed neighbourhoods ...
Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (suffic...
AbstractA connected graph is λp,q-connected if there is a set of edges whose deletion leaves two com...
In this paper we show that for any two vertices x, y of a 6-connected graph G, there exists a path b...
A graph is said to be p-connected if for every partition of its vertices into two non-empty, disjoin...
Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-conne...
AbstractFor a connected graph G, an edge set S is a k-restricted edge-cut if G−S is disconnected and...
AbstractThe connected cutset connectivity (connected edge-cutset connectivity) of a nontrivial conne...
Let k be a positive integer. A graph G = (V,E) is said to be a k - connected graph if for any given ...
AbstractA graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph...
We prove a necessary and sufficient condition under which a connected graph has a connected P₃-path ...
L. Dubins conjectured in 1984 that the graph on vertices {1, 2, 3, ...} where an edge is drawn betwe...
AbstractIf the monochromatic graphs G1 and G2 in a 2-edge-coloured complete graph Km (m⩾6) are conne...
The edge-connectivity l of a connected graph is the minimum number of edges whose deletion produc...
In this note we show that every connected graph G of order >> 3 has two distinct vertices u and v s...
AbstractIf instead of removing only vertices from a graph, one removes entire closed neighbourhoods ...
Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (suffic...
DOI
Add to ORKG