Yuefang Sun

activity

20092022

most citedThe generalized 3-connectivity of Cartesian product graphs

19 citations · 41 across the 14 of their papers we have counts for

collaborators

19 papers

math.CO2022

A minimum semi-degree condition for unpaired many-to-many disjoint path covers in digraphs

Ansong Ma, Yuefang Sun

For a digraph $D$ , let $δ^{0} (D) = min {δ^{+} (D), δ^{-} (D)}$ be the minimum semi-degree of $D$ . A set of $k$ vertex-disjoint paths, ${P_{1}, \dots, P_{k}}$ , joining a disjoint…

math.CO2021

Packing Strong Subgraph in Digraphs

Yuefang Sun, Gregory Gutin, Xiaoyan Zhang

In this paper, we study two types of strong subgraph packing problems in digraphs, including internally disjoint strong subgraph packing problem and arc-disjoint strong subgraph pa…

math.CO2020

Extremal results for directed tree connectivity

Yuefang Sun

For a digraph $D = (V (D), A (D))$ , and a set $S \subseteq V (D)$ with $r \in S$ and $∣ S ∣ \geq 2$ , an $(S, r)$ -tree is an out-tree $T$ rooted at $r$ with $S \subseteq V (T)$ . Two $(S, r)$ -tr…

math.CO2020

Semicomplete Compositions of Digraphs

Yuefang Sun

Let $T$ be a digraph with vertices $u_{1}, \dots, u_{t}$ ( $t \geq 2$ ) and let $H_{1}, \dots, H_{t}$ be digraphs such that $H_{i}$ has vertices $u_{i, j_{i}}, 1 \leq j_{i} \leq n_{i} .$ Then the compositi…

math.CO2020

Directed Steiner tree packing and directed tree connectivity

Yuefang Sun, Anders Yeo

cs.DM2019

Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs

Gregory Gutin, Yuefang Sun

A digraph $D = (V, A)$ has a good pair at a vertex $r$ if $D$ has a pair of arc-disjoint in- and out-branchings rooted at $r$ . Let $T$ be a digraph with $t$ vertices $u_1,\dots , u_t…