Set Connectivity and Graph Orientation Theorems
T. Fukunaga · 2009
For an undirected graph G, an orientation of G is defined as a digraph obtained by replacing each edge with an arc. In this paper, we discuss conditions for G to have an orientation that satisfies given demands on the edge-connectivity between disjoint vertex sets. 1