𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Packing T-Cuts

✍ Scribed by A. Frank; Z. Szigeti

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
355 KB
Volume
61
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

Notes
On Packing (T)-Cuts*

AndrΓ‘s Frank ({ }^{\dagger})

Research Institute for Discrete Mathematics, University of Bonn, Nassestr. 2, Bonn-1, Germany, D-5300

Received July 2, 1992

A short proof of a difficult theorem of P. D. Seymour on grafts with the max-flow

πŸ“œ SIMILAR VOLUMES

On the integral 4-packing of T-cuts
On the integral 4-packing of T-cuts
✍ Frieda Granot; Michal Penn πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 777 KB

Let C = (V, E) be an undirected graph, w : E + Z' a weight function and T c V an even subset of vertices from G. A T-cut is an edge-cut set which divides T into two odd sets. For ( Tj = 4 Seymour gave a good characterization of the graphs for which there exists a maximum packing of T-cuts that is in

Two-Trees Optimal T-Join and Integral Pa
Two-Trees Optimal T-Join and Integral Packing of T-Cuts
✍ E. Korach πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 387 KB

Let \(G\) be an undirected graph, \(T\) an even subset of vertices and \(F\) an optimal \(T\)-join, which is a forest of two trees. The main theorem of this paper characterizes the cases, where \((G, T)\) has an optimal packing of \(T\)-cuts which is integral. This theorem unifies and generalizes a

Packing cuts in undirected graphs
Packing cuts in undirected graphs
✍ Alberto Caprara; Alessandro Panconesi; Romeo Rizzi πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 160 KB