Ma, Chung-fan; Cai, Mao-cheng The maximum number of arc-disjoint arborescences in a tournament. (English) Zbl 0458.05037 J. Graph Theory 6, 295-302 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 05C20 Directed graphs (digraphs), tournaments Keywords:arborescence; tournament; r-partite graph; oriented graph PDFBibTeX XMLCite \textit{C.-f. Ma} and \textit{M.-c. Cai}, J. Graph Theory 6, 295--302 (1982; Zbl 0458.05037) Full Text: DOI References: [1] Edge-disjoint branchings. In Combinatorial algorithms, Ed., Academic, New York (1973) pp. 91–96. This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.