Shanshan Yu

collaborators

3 papers

math.CO2026

Arc-disjoint Steiner Cycles in Digraphs

Jie Bai, Yuefang Sun, Chuchu Wang +1

Let $D = (V (D), A (D))$ be a digraph of order $n$ and let $S \subseteq V (D)$ with $2 \leq ∣ S ∣ \leq n$ . A directed cycle $C$ of $D$ is called a directed $S$ -Steiner cycle (or, an $S$ -cycl…

math.CO2026

Internally-disjoint Pendant Steiner Trees in Digraphs

Shanshan Yu, Yuefang Sun

For a digraph $D = (V (D), A (D))$ and a set $S \subseteq V (D)$ with $∣ S ∣ \geq 2$ and $r \in S$ , a directed pendant $(S, r)$ -Steiner tree (or, simply, a pendant $(S, r)$ -tree) is an out-tree…

math.CO2026

Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs

Shanshan Yu, Yuefang Sun

Let $D = (V (D), A (D))$ be a digraph with a terminal vertex subset $S \subseteq V (D)$ such that $∣ S ∣ = k \geq 2$ . An out-tree $T$ of $D$ rooted at $r$ is called a directed pendant $(S, r)$ -…