Department of Applied Mathematics & Physics, Kyoto University

Technical Report 2009-001 (January 07, 2009)

Set Connectivity and Graph Orientation Theorems
by Takuro Fukunaga

pdf File

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.