Colussi, Livio, Conforti, Michele and Zambelli, Giacomo (2005) Disjoint paths in arborescences. Discrete mathematics, 292 (1-3). pp. 187-191. ISSN 0012-365X
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds characterizes which digraphs have λ arc-disjoint arborescences rooted at r. A similar theorem of Menger guarantees that λ strongly arc disjoint rv-paths exist for every vertex v, where “strongly” means that no two paths contain a pair of symmetric arcs. We prove that if a directed graph D contains two arc-disjoint spanning arborescences rooted at r, then D contains two such arborences with the property that for every node v the paths from r to v in the two arborences satisfy Menger's theorem.
|Additional Information:||© 2005 Elsevier|
|Uncontrolled Keywords:||disjoint spanning arborescences|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Management|
Actions (login required)
|Record administration - authorised staff only|