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
Until recently, the number of non-separable graphs on seven or fewer points was known due to hand co...
ABSTRACT. We study Hausdorff continua in which every set of certain cardinality contains a subset wh...
AbstractWe prove that every finite 4-connected graph G has at least 134⋅(|E(G)|−2|V(G)|) many contra...
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...
In curve theory there is a long history of taking some interesting disconnection property and then ...
Let A ' be a non-degenerate compact connected metric space. It is proved that if there is an n,...
summary:The paper deals with locally connected continua $X$ in the Euclidean plane. Theorem 1 assert...
AbstractIn this paper we introduce a numerical invariant of digraphs which generalizes that of the n...
Abstract— Given a graph G(V,E) with n vertices and m edges, where every vertex is labeled, there are...
AbstractFor a graph G, we can consider the minimum number of vertices (resp. edges) whose deletion d...
AbstractSuppose that {Yi}i=1∞ is a collection of disjoint subcontinua of continuum X such that limi→...
AbstractGiven a simple connected graph G, let κ(n) [λ(n)] be the minimum cardinality of a set of ver...
AbstractUsing only the set of point-deleted subgraphs, several invariants of a graph are derived. Th...
AbstractThe acyclic disconnection of a digraph D is the maximum number of components that can be obt...
Until recently, the number of non-separable graphs on seven or fewer points was known due to hand co...
ABSTRACT. We study Hausdorff continua in which every set of certain cardinality contains a subset wh...
AbstractWe prove that every finite 4-connected graph G has at least 134⋅(|E(G)|−2|V(G)|) many contra...
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...
In curve theory there is a long history of taking some interesting disconnection property and then ...
Let A ' be a non-degenerate compact connected metric space. It is proved that if there is an n,...
summary:The paper deals with locally connected continua $X$ in the Euclidean plane. Theorem 1 assert...
AbstractIn this paper we introduce a numerical invariant of digraphs which generalizes that of the n...
Abstract— Given a graph G(V,E) with n vertices and m edges, where every vertex is labeled, there are...
AbstractFor a graph G, we can consider the minimum number of vertices (resp. edges) whose deletion d...
AbstractSuppose that {Yi}i=1∞ is a collection of disjoint subcontinua of continuum X such that limi→...
AbstractGiven a simple connected graph G, let κ(n) [λ(n)] be the minimum cardinality of a set of ver...
AbstractUsing only the set of point-deleted subgraphs, several invariants of a graph are derived. Th...
AbstractThe acyclic disconnection of a digraph D is the maximum number of components that can be obt...
Until recently, the number of non-separable graphs on seven or fewer points was known due to hand co...
ABSTRACT. We study Hausdorff continua in which every set of certain cardinality contains a subset wh...
AbstractWe prove that every finite 4-connected graph G has at least 134⋅(|E(G)|−2|V(G)|) many contra...