Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

@article{BangJensen1995PreservingAI,
  title={Preserving and Increasing Local Edge-Connectivity in Mixed Graphs},
  author={J\orgen Bang-Jensen and Andr{\'a}s Frank and Bill Jackson},
  journal={SIAM J. Discrete Math.},
  year={1995},
  volume={8},
  pages={155-178}
}
Generalizing and unifying earlier results of W. Mader and of the second and third authors, we prove two splitting theorems concerning mixed graphs. By invoking these theorems we obtain min-max formulae for the minimum number of new edges to be added to a mixed graph so that the resulting graph satisses local edge-connectivity prescriptions. An extension of Edmonds' theorem on disjoint arborescences is also deduced along with a new suucient condition for the solvability of the edge-disjoint… CONTINUE READING