Disjoint paths in arborescences

DOI10.1016/j.disc.2004.12.005zbMath1059.05059OpenAlexW2028813890MaRDI QIDQ1773369

Livio Colussi, Giacomo Zambelli, Michele Conforti

Publication date: 28 April 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.12.005

zbMATH Keywords

Disjoint spanning arborescences

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Unnamed Item
• The multi-tree approach to reliability in distributed networks
• Independent trees in graphs
• A matroid approach to finding edge connectivity and packing arborescences
• Vertex-disjoint paths and edge-disjoint branchings in directed graphs
• Disproof of a conjecture about independent branchings in k‐connected directed graphs

This page was built for publication: Disjoint paths in arborescences