AbstractFor an undirected graph G=(V, E) and a collection S of disjoint subsets of V, an S-path is a path connecting different sets in S. We give a short proof of Mader's min-max theorem for the maximum number of disjoint S-paths
AbstractThe path-connectivity of a graph G is the maximal k for which between any k pairs of vertice...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
AbstractSuppose that (s1,t1),…,(sk,tk) are pairs of vertices of a graph. When can one choose a path ...
AbstractSuppose G is a finite graph and let T ⊆ V(G) be a subset of its vertices throughout referred...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
AbstractGiven an undirected graphG=(V,E) and a partition {S,T} ofV, anS−Tconnector is a set of edges...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
We are given a graph $G$, an independant set $\mathcal{S} \subset V(G)$ of \emph{terminals}, and a f...
AbstractIf the paths of length ⩽s, joining two non-adjacent vertices u, υ of a graph cannot be destr...
AbstractConsider a collection of disjoint paths in graph G such that every vertex is on one of these...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
AbstractThe path-connectivity of a graph G is the maximal k for which between any k pairs of vertice...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
AbstractSuppose that (s1,t1),…,(sk,tk) are pairs of vertices of a graph. When can one choose a path ...
AbstractSuppose G is a finite graph and let T ⊆ V(G) be a subset of its vertices throughout referred...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
AbstractGiven an undirected graphG=(V,E) and a partition {S,T} ofV, anS−Tconnector is a set of edges...
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group G and let A¿V. ...
We are given a graph $G$, an independant set $\mathcal{S} \subset V(G)$ of \emph{terminals}, and a f...
AbstractIf the paths of length ⩽s, joining two non-adjacent vertices u, υ of a graph cannot be destr...
AbstractConsider a collection of disjoint paths in graph G such that every vertex is on one of these...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
AbstractThe path-connectivity of a graph G is the maximal k for which between any k pairs of vertice...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
AbstractSuppose that (s1,t1),…,(sk,tk) are pairs of vertices of a graph. When can one choose a path ...
DOI
Add to ORKG