Arc‐disjoint arborescences of digraphs
Cai Mao‐cheng · Journal of Graph Theory · 1983
Abstract The purpose of this paper is to give a necessary and sufficient condition for a digraph G to contain k arc‐disjoint arborescences so that the number rooted at each vertex x of G lies in some prescribed interval which depends on x.