| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513558 | Discrete Mathematics | 2005 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Livio Colussi, Michele Conforti, Giacomo Zambelli,