Arc‐disjoint arborescences of digraphs
Author:
- Cai Mao‐ChengCMCai Mao‐Cheng
- 1 June 1983
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 7 (2) , 235-240
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.Keywords
This publication has 2 references indexed in Scilit:
- The maximum number of arc-disjoint arborescences in a tournamentJournal of Graph Theory, 1982
- Graph Theory with Applications1976