Strong orientation of a connected graph for a crossing family
Abdi, A.
, Dalirrooyfarda, M. & Neuwohner, M.
(2025).
Strong orientation of a connected graph for a crossing family.
Operations Research Letters,
62,
https://doi.org/10.1016/j.orl.2025.107333
, Dalirrooyfarda, M. & Neuwohner, M.
(2025).
Strong orientation of a connected graph for a crossing family.
Operations Research Letters,
62,
https://doi.org/10.1016/j.orl.2025.107333
Given a connected graph G = (V , E) and a crossing family C over ground set V such that | δ G ( U ) | ≥ 2 for every U ∈ C , we prove there exists a strong orientation of G for C , i.e., an orientation of G such that each set in C has at least one outgoing and at least one incoming arc. This implies the main conjecture in Chudnovsky et al. (2016) [3].
