We give a class of graphs with the property that for each even set T of nodes in G the minimum length of a T-join is equal to the maximum number of pairwise edge disjoint T-cuts. Our class contains the bipartite and the series-parallel graphs for which this property was derived earlier by Seymour
AbstractFrom a digraph D form a graph G whose vertices are the arcs of D, two vertices are joined if...
We study max-cut in classes of graphs defined by forbidding a single graph as a subgraph, induced su...
Given an undirected graphG=(V, E) and a partition {S, T} ofV, anS-Tconnectoris a set of edgesF¿Esuch...
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...
AbstractA very short proof of Seymour's theorem, stating that in bipartite graphs the minimum cardin...
AbstractFrank et al. (Math. Programming Stud. 22 (1984) 99–112) proved that for any connected bipart...
AbstractA (T, d)-join arises as a natural generalization of the well-known notion of a T-join. Given...
Abstract. Given a graph with nonnegative capacities on its edges, it is well known that the capacity...
none3Given an undirected graph G with n nodes and m edges, we address the problem of finding a larg...
Let G be a graph and T an even cardinality subset of its vertices. We call (G,T) a graft. A T-join i...
Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum n...
Given a graph G=V,E, a connected sides cut U,V\U or δU is the set of edges of E linking all vertices...
We consider the bipartite cut and the judicious partition problems in graphs of girth at least 4. Fo...
AbstractA short proof of a difficult theorem of P. D. Seymour on grafts with the max-flow min-cut pr...
AbstractFrom a digraph D form a graph G whose vertices are the arcs of D, two vertices are joined if...
We study max-cut in classes of graphs defined by forbidding a single graph as a subgraph, induced su...
Given an undirected graphG=(V, E) and a partition {S, T} ofV, anS-Tconnectoris a set of edgesF¿Esuch...
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...
AbstractA very short proof of Seymour's theorem, stating that in bipartite graphs the minimum cardin...
AbstractFrank et al. (Math. Programming Stud. 22 (1984) 99–112) proved that for any connected bipart...
AbstractA (T, d)-join arises as a natural generalization of the well-known notion of a T-join. Given...
Abstract. Given a graph with nonnegative capacities on its edges, it is well known that the capacity...
none3Given an undirected graph G with n nodes and m edges, we address the problem of finding a larg...
Let G be a graph and T an even cardinality subset of its vertices. We call (G,T) a graft. A T-join i...
Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum n...
Given a graph G=V,E, a connected sides cut U,V\U or δU is the set of edges of E linking all vertices...
We consider the bipartite cut and the judicious partition problems in graphs of girth at least 4. Fo...
AbstractA short proof of a difficult theorem of P. D. Seymour on grafts with the max-flow min-cut pr...
AbstractFrom a digraph D form a graph G whose vertices are the arcs of D, two vertices are joined if...
We study max-cut in classes of graphs defined by forbidding a single graph as a subgraph, induced su...
Given an undirected graphG=(V, E) and a partition {S, T} ofV, anS-Tconnectoris a set of edgesF¿Esuch...
DOI
Add to ORKG