Disjoint paths in arborescences
type: Item
instance of: scholarly article
title: Disjoint paths in arborescences
zbMATH Open document ID: 1059.05059
author: Livio Colussi
author: Michele Conforti
author: Giacomo Zambelli
published in: Discrete Mathematics
publication date: 2005-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 2162071
zbMATH Keywords: Disjoint spanning arborescences
MaRDI profile type: Publication
full work available at URL: j.disc.2004.12.005
OpenAlex ID: W2028813890
cites work: Q4871749
cites work: A matroid approach to finding edge connectivity and packing arborescences
cites work: Independent trees in graphs
cites work: Disproof of a conjecture about independent branchings in k‐connected directed graphs
cites work: The multi-tree approach to reliability in distributed networks
cites work: Vertex-disjoint paths and edge-disjoint branchings in directed graphs
DOI: 10.1016/J.DISC.2004.12.005
description: scientific article; zbMATH DE number 2162071