| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650367 | Discrete Mathematics | 2008 | 6 Pages |
Abstract
In this note we solve the edge-connectivity augmentation problem over symmetric parity families. It provides a solution for the minimum TT-cut augmentation problem. We also extend a recent result of Zhang [C.Q. Zhang, Circular flows of nearly eulerian graphs and vertex splitting, J. Graph Theory 40 (2002) 147–161].
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zoltán Szigeti,