A connected graph admits a strong orientation for every crossing family whose members have at least two boundary edges, resolving a conjecture in the theory of disjoint dijoins.
On packing dijoins in digraphs and weighted digraphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Strong orientation of a connected graph for a crossing family
A connected graph admits a strong orientation for every crossing family whose members have at least two boundary edges, resolving a conjecture in the theory of disjoint dijoins.