Covering the edge set of a directed graph with trees
From MaRDI portal
Publication:1250108
DOI10.1016/0012-365X(78)90174-7zbMath0388.05021MaRDI QIDQ1250108
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
05C05: Trees
05C20: Directed graphs (digraphs), tournaments
05B40: Combinatorial aspects of packing and covering
Related Items
Covering directed graphs by in-trees, Restricted covering of digraphs with arborescences, Generalized polymatroids and submodular flows, An application of submodular flows, Covering Directed Graphs by In-Trees, The Minimum Weight In-Tree Cover Problem