DOIAbstract
AbstractA very short proof of Seymour's theorem, stating that in bipartite graphs the minimum cardinality of a t-joint is equal to the maximum cardinality of an edge-disjoint packing of t-cuts, is given
AbstractA very short proof of Seymour's theorem, stating that in bipartite graphs the minimum cardinality of a t-joint is equal to the maximum cardinality of an edge-disjoint packing of t-cuts, is given
AbstractLet G be an undirected graph, T an even subset of vertices and F an optimal T-join, which is...
Abstract. Given a graph with nonnegative capacities on its edges, it is well known that the capacity...
Take a graph G, an edge subset Σ ⊆ E(G), and a set of terminals T ⊆V(G) where |T| is even. The tripl...
AbstractA very short proof of Seymour's theorem, stating that in bipartite graphs the minimum cardin...
We give a class of graphs with the property that for each even set T of nodes in G the minimum lengt...
AbstractWe give a class of graphs with the property that for each even set T of nodes in G the minim...
SIGLETIB: RN 4052 (85383-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...
Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum n...
AbstractFrank et al. (Math. Programming Stud. 22 (1984) 99–112) proved that for any connected bipart...
Let G be a graph and T an even cardinality subset of its vertices. We call (G,T) a graft. A T-join i...
Let G = (V,E) be a graph, and T ⊆ V a nonempty subset of even cardinality. The famous theorem of Edm...
AbstractA (T, d)-join arises as a natural generalization of the well-known notion of a T-join. Given...
AbstractPetersen's theorem asserts that any cubic graph with at most 2 cut edges has a perfect match...
AbstractA short proof of a difficult theorem of P. D. Seymour on grafts with the max-flow min-cut pr...
Let G be a plane graph and T an even subset of its vertices. It has been conjectured that if all T-...
AbstractLet G be an undirected graph, T an even subset of vertices and F an optimal T-join, which is...
Abstract. Given a graph with nonnegative capacities on its edges, it is well known that the capacity...
Take a graph G, an edge subset Σ ⊆ E(G), and a set of terminals T ⊆V(G) where |T| is even. The tripl...
AbstractA very short proof of Seymour's theorem, stating that in bipartite graphs the minimum cardin...
We give a class of graphs with the property that for each even set T of nodes in G the minimum lengt...
AbstractWe give a class of graphs with the property that for each even set T of nodes in G the minim...
SIGLETIB: RN 4052 (85383-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...
Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum n...
AbstractFrank et al. (Math. Programming Stud. 22 (1984) 99–112) proved that for any connected bipart...
Let G be a graph and T an even cardinality subset of its vertices. We call (G,T) a graft. A T-join i...
Let G = (V,E) be a graph, and T ⊆ V a nonempty subset of even cardinality. The famous theorem of Edm...
AbstractA (T, d)-join arises as a natural generalization of the well-known notion of a T-join. Given...
AbstractPetersen's theorem asserts that any cubic graph with at most 2 cut edges has a perfect match...
AbstractA short proof of a difficult theorem of P. D. Seymour on grafts with the max-flow min-cut pr...
Let G be a plane graph and T an even subset of its vertices. It has been conjectured that if all T-...
AbstractLet G be an undirected graph, T an even subset of vertices and F an optimal T-join, which is...
Abstract. Given a graph with nonnegative capacities on its edges, it is well known that the capacity...
Take a graph G, an edge subset Σ ⊆ E(G), and a set of terminals T ⊆V(G) where |T| is even. The tripl...
Add to ORKG