Edge-disjoint in- and out-branchings in tournaments and related path problems

Authors:
Joørgen Bang-Jensen
Affiliations:
-
Venue:
Journal of Combinatorial Theory Series B
Year:
1991

Citing 0
Cited 4

The minimum spanning strong subdigraph problem is fixed parameter tractable

Discrete Applied Mathematics
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph

Information Processing Letters
Decomposing locally semicomplete digraphs into strong spanning subdigraphs

Journal of Combinatorial Theory Series B
Note: Arc-disjoint paths and trees in 2-regular digraphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract