Strong digraph compositions with each component size at least 2 have arc-disjoint in- and out-branchings at every vertex; semicomplete compositions are fully characterized for this property.
Bang-Jensen and J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A survey compiling known results on directed Steiner tree packing, path packing, pendant Steiner tree packing, strong subgraph packing, strong arc decomposition, and cycle packing problems in digraphs, including conjectures and open problems.
citing papers explorer
-
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs
Strong digraph compositions with each component size at least 2 have arc-disjoint in- and out-branchings at every vertex; semicomplete compositions are fully characterized for this property.
-
Steiner Type Packing Problems in Digraphs: A Survey
A survey compiling known results on directed Steiner tree packing, path packing, pendant Steiner tree packing, strong subgraph packing, strong arc decomposition, and cycle packing problems in digraphs, including conjectures and open problems.