Skip to main content
Article thumbnail
Location of Repository

Disjoint paths in arborescences

By Livio Colussi, Michele Conforti and Giacomo Zambelli

Abstract

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

Topics: QA Mathematics
Publisher: Elsevier
Year: 2005
DOI identifier: 10.1016/j.disc.2004.12.005
OAI identifier: oai:eprints.lse.ac.uk:31725
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.elsevier.com/wps/fi... (external link)
  • http://eprints.lse.ac.uk/31725... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.