Arc‐disjoint arborescences of digraphs

DOI10.1002/jgt.3190070213zbMath0498.05033OpenAlexW1985599306MaRDI QIDQ3963032

Mao-cheng Cai

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070213

zbMATH Keywords

arborescence

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

An application of submodular flows ⋮ Packing of spanning mixed arborescences ⋮ The local structure of injective LOT-complexes ⋮ A Survey on Covering Supermodular Functions ⋮ Restricted covering of digraphs with arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings ⋮ Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Cites Work

• Unnamed Item

This page was built for publication: Arc‐disjoint arborescences of digraphs