Disjoint paths in arborescences

DOI10.1016/J.DISC.2004.12.005MaRDI QIDQ1773369zbMATH OpenOpenAlexFDO

Authors Livio Colussi, Michele Conforti, Giacomo Zambelli

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)

Recommendations

• Arc-disjoint in-trees in directed graphs
• Publication:5206398
• Independent arborescences in directed graphs
• Common root functions of two digraphs
• Paths, cycles, and arc‐connectivity in digraphs

Cites work

• scientific article; zbMATH DE number 863470 (Why is no real title available?)
• A matroid approach to finding edge connectivity and packing arborescences
• Disproof of a conjecture about independent branchings in k‐connected directed graphs
• Independent trees in graphs
• The multi-tree approach to reliability in distributed networks
• Vertex-disjoint paths and edge-disjoint branchings in directed graphs

Cited in

(9)

• Arc-disjoint in-trees in directed graphs
• Independent arborescences in directed graphs
• A note on disjoint arborescences
• Disjoint paths in unions of tournaments
• The root location problem for arc-disjoint arborescences
• Disjoint Paths in the Plane
• Common root functions of two digraphs
• scientific article; zbMATH DE number 1439419 (Why is no real title available?)
• A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph

This page was built for publication: Disjoint paths in arborescences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773369)