Alexander A. Ageev. On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs. In Jaroslav Nesetril, editor, Algorithms - ESA 99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings. Volume 1643 of Lecture Notes in Computer Science, pages 490-497, Springer, 1999. [doi]
Abstract is missing.