1. Edge disjoint branchings;Edmonds,1973
2. On the orientation of graphs;Frank;J. Combinatorial Theory, Ser. B,1980
3. A. Frank, Connectivity augmentation problems in network design, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming: State of the Art, The University of Michigan, 1994, pp. 34–63.
4. Connectivity and network flows;Frank,1995
5. Graph orientations with edge-connections and parity constraints;Frank;Combinatorica,2002