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)
Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of packing and covering (05B40)
Related Items (8)
An overview of graph covering and partitioning ⋮ Generalized polymatroids and submodular flows ⋮ An application of submodular flows ⋮ Covering directed graphs by in-trees ⋮ Covering Directed Graphs by In-Trees ⋮ A Survey on Covering Supermodular Functions ⋮ Restricted covering of digraphs with arborescences ⋮ The Minimum Weight In-Tree Cover Problem
This page was built for publication: Covering the edge set of a directed graph with trees
