Covering the edge set of a directed graph with trees

DOI10.1016/0012-365X(78)90174-7MaRDI QIDQ1250108zbMATH OpenFDO

Authors K. Vidyasankar

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(78)90174-7

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Cited in

(10)

• Generalized polymatroids and submodular flows
• An application of submodular flows
• An overview of graph covering and partitioning
• A Survey on Covering Supermodular Functions
• Covering Directed Graphs by In-Trees
• The Minimum Weight In-Tree Cover Problem
• Covering directed graphs by in-trees
• Linearly representable submodular functions: an algebraic algorithm for minimization
• How to see the forest despite the trees
• Restricted covering of digraphs with arborescences

This page was built for publication: Covering the edge set of a directed graph with trees

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