AbstractWe present a simple way to obtain all graphs with a given disconnection number if we know all the graphs with smaller disconnection number. Using this method we answer a question of Sam B. Nadler, i.e. we prove that there exist precisely 26 continua with disconnection number four. Some known results concerning disconnection number are also obtained as simple corollaries. Further we give some estimates on the number of distinct continua with a fixed disconnection number which concerns a problem of Sam B. Nadler
All digraphs are determined that have the property that when any vertex and any edge that are not ad...
The super–connectivity of a graph G is the minimum number of vertices whose removal disconnects the ...
AbstractThis paper analyzes the problem of maximizing the disconnectivity of undirected graphs by de...
AbstractWe present a simple way to obtain all graphs with a given disconnection number if we know al...
AbstractThe disconnection number d(X) is the least number of points in a connected topological graph...
AbstractIn this paper we introduce a numerical invariant of digraphs which generalizes that of the n...
ABSTRACT. We study Hausdorff continua in which every set of certain cardinality contains a subset wh...
Let A ' be a non-degenerate compact connected metric space. It is proved that if there is an n,...
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two...
Until recently, the number of non-separable graphs on seven or fewer points was known due to hand co...
Let G be a 4-connected graph. For an edge e of G; we do the following operations on G: first, delete...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
In curve theory there is a long history of taking some interesting disconnection property and then ...
AbstractLet G be a 4-connected graph. For an edge e of G, we do the following operations on G: first...
Abstract— Given a graph G(V,E) with n vertices and m edges, where every vertex is labeled, there are...
All digraphs are determined that have the property that when any vertex and any edge that are not ad...
The super–connectivity of a graph G is the minimum number of vertices whose removal disconnects the ...
AbstractThis paper analyzes the problem of maximizing the disconnectivity of undirected graphs by de...
AbstractWe present a simple way to obtain all graphs with a given disconnection number if we know al...
AbstractThe disconnection number d(X) is the least number of points in a connected topological graph...
AbstractIn this paper we introduce a numerical invariant of digraphs which generalizes that of the n...
ABSTRACT. We study Hausdorff continua in which every set of certain cardinality contains a subset wh...
Let A ' be a non-degenerate compact connected metric space. It is proved that if there is an n,...
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two...
Until recently, the number of non-separable graphs on seven or fewer points was known due to hand co...
Let G be a 4-connected graph. For an edge e of G; we do the following operations on G: first, delete...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
In curve theory there is a long history of taking some interesting disconnection property and then ...
AbstractLet G be a 4-connected graph. For an edge e of G, we do the following operations on G: first...
Abstract— Given a graph G(V,E) with n vertices and m edges, where every vertex is labeled, there are...
All digraphs are determined that have the property that when any vertex and any edge that are not ad...
The super–connectivity of a graph G is the minimum number of vertices whose removal disconnects the ...
AbstractThis paper analyzes the problem of maximizing the disconnectivity of undirected graphs by de...