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
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds c...
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds c...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
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...
AbstractA short proof of the classical theorem of Menger concerning the number of disjoint AB-paths ...
Let G be a unicyclic graph such that at most two points on its cycle have degrees greater-than-or-eq...
We discuss heuristic and structural algorithms to construct long simple paths in the divisor graph D...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractWe obtain a polynomial algorithm in O(nm) time to find a long path in any graph with n verti...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
AbstractThe Path Partition Conjecture states that the vertices of a graph G with longest path of len...
AbstractLet G=(V,E) be a connected graph of order n, t a real number with t⩾1 and M⊆V(G) with |M|⩾nt...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds c...
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds c...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
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...
AbstractA short proof of the classical theorem of Menger concerning the number of disjoint AB-paths ...
Let G be a unicyclic graph such that at most two points on its cycle have degrees greater-than-or-eq...
We discuss heuristic and structural algorithms to construct long simple paths in the divisor graph D...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractWe obtain a polynomial algorithm in O(nm) time to find a long path in any graph with n verti...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
AbstractThe Path Partition Conjecture states that the vertices of a graph G with longest path of len...
AbstractLet G=(V,E) be a connected graph of order n, t a real number with t⩾1 and M⊆V(G) with |M|⩾nt...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds c...
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds c...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
DOI
Add to ORKG