AbstractIn this paper we prove a Mengerian theorem for long paths, namely, that if in order to cut every uv-path of length at least n (n ≥ 2), in a diagraph D, we need to remove at least h points, then there exist {h(3n − 5)} interior disjoint uv-paths in D of length at least n. Some variations and applications of this theorem are given as well
Recently, Letzter proved that any graph of order n contains a collection P of O(nlog⋆ n) paths with ...
Recently, Letzter proved that any graph of order n contains a collection P of O(nlog⋆ n) paths with ...
AbstractFor an undirected graph G=(V, E) and a collection S of disjoint subsets of V, an S-path is a...
AbstractIn this paper we prove a Mengerian theorem for long paths, namely, that if in order to cut e...
AbstractIf the paths of length ⩽s, joining two non-adjacent vertices u, υ of a graph cannot be destr...
AbstractIf the paths of length ⩽s, joining two non-adjacent vertices u, υ of a graph cannot be destr...
AbstractIn a recent paper Lovász, Neumann-Lara and Plummer proved some Mengerian theorems for paths ...
We present a strengthening of the countable Menger's theorem of R. Aharoni. Let D = (V, A) be a coun...
Let G be a unicyclic graph such that at most two points on its cycle have degrees greater-than-or-eq...
We prove Menger-type results in which the obtained paths are pairwise non-adjacent, both for graphs ...
AbstractFor positive integers d and m, let Pd,m(G) denote the property that between each pair of ver...
Abstract. We provide a new proof of a theorem of Saks which is an extension of Greene's Theorem...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his ...
Recently, Letzter proved that any graph of order n contains a collection P of O(nlog⋆ n) paths with ...
Recently, Letzter proved that any graph of order n contains a collection P of O(nlog⋆ n) paths with ...
AbstractFor an undirected graph G=(V, E) and a collection S of disjoint subsets of V, an S-path is a...
AbstractIn this paper we prove a Mengerian theorem for long paths, namely, that if in order to cut e...
AbstractIf the paths of length ⩽s, joining two non-adjacent vertices u, υ of a graph cannot be destr...
AbstractIf the paths of length ⩽s, joining two non-adjacent vertices u, υ of a graph cannot be destr...
AbstractIn a recent paper Lovász, Neumann-Lara and Plummer proved some Mengerian theorems for paths ...
We present a strengthening of the countable Menger's theorem of R. Aharoni. Let D = (V, A) be a coun...
Let G be a unicyclic graph such that at most two points on its cycle have degrees greater-than-or-eq...
We prove Menger-type results in which the obtained paths are pairwise non-adjacent, both for graphs ...
AbstractFor positive integers d and m, let Pd,m(G) denote the property that between each pair of ver...
Abstract. We provide a new proof of a theorem of Saks which is an extension of Greene's Theorem...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his ...
Recently, Letzter proved that any graph of order n contains a collection P of O(nlog⋆ n) paths with ...
Recently, Letzter proved that any graph of order n contains a collection P of O(nlog⋆ n) paths with ...
AbstractFor an undirected graph G=(V, E) and a collection S of disjoint subsets of V, an S-path is a...
DOI
Add to ORKG