Determines the computational complexity of computing the maximum number of arc-disjoint S-Steiner cycles in Eulerian, planar and symmetric digraphs and gives closed-form values of the directed cycle k-arc-connectivity in complete, complete bipartite and regular complete multipartite digraphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Arc-disjoint Steiner Cycles in Digraphs
Determines the computational complexity of computing the maximum number of arc-disjoint S-Steiner cycles in Eulerian, planar and symmetric digraphs and gives closed-form values of the directed cycle k-arc-connectivity in complete, complete bipartite and regular complete multipartite digraphs.