AbstractIf the paths of length ⩽s, joining two non-adjacent vertices u, υ of a graph cannot be destroyed by deleting less than t vertices, then there are at least t internally vertex-disjoint paths joining u and υ, each having length less than (t+s−2s−2)+(t+s−3s−2). Some constructions show that using paths of length at least st−1t might be necessary
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
The xy-Menger number with respect to a given integer ℓ, for every two vertices x, y in a connected ...
AbstractIf the paths of length ⩽s, joining two non-adjacent vertices u, υ of a graph cannot be destr...
We prove Menger-type results in which the obtained paths are pairwise non-adjacent, both for graphs ...
AbstractIn this paper we prove a Mengerian theorem for long paths, namely, that if in order to cut e...
AbstractIn a recent paper Lovász, Neumann-Lara and Plummer proved some Mengerian theorems for paths ...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractFor positive integers d and m, let Pd,m(G) denote the property that between each pair of ver...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
Let P-1,...,P-k be k vertex-disjoint paths in a graph G where the ends of P-i are x(i), and y(i). Le...
Let G be a unicyclic graph such that at most two points on its cycle have degrees greater-than-or-eq...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
The xy-Menger number with respect to a given integer ℓ, for every two vertices x, y in a connected ...
AbstractIf the paths of length ⩽s, joining two non-adjacent vertices u, υ of a graph cannot be destr...
We prove Menger-type results in which the obtained paths are pairwise non-adjacent, both for graphs ...
AbstractIn this paper we prove a Mengerian theorem for long paths, namely, that if in order to cut e...
AbstractIn a recent paper Lovász, Neumann-Lara and Plummer proved some Mengerian theorems for paths ...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractFor positive integers d and m, let Pd,m(G) denote the property that between each pair of ver...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
Let P-1,...,P-k be k vertex-disjoint paths in a graph G where the ends of P-i are x(i), and y(i). Le...
Let G be a unicyclic graph such that at most two points on its cycle have degrees greater-than-or-eq...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
The xy-Menger number with respect to a given integer ℓ, for every two vertices x, y in a connected ...
DOI
Add to ORKG
