Yuefang Sun

activity

20092022

most citedOn the generalized (edge-)connectivity of graphs

54 citations · 110 across the 36 of their papers we have counts for

collaborators

Showing 2022Show all

7 papers · 1 filter

math.CO2022

Directed Steiner path packing and directed path 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$ , a directed $(S, r)$ -Steiner path or, simply, an $(S, r)$ -path is a directed path $P$ star…

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.CO2022

Sharp Bounds and Precise Values for the $N_{i}$ -Chromatic Number of Graphs

Yangfan Yu, Yuefang Sun

Let $G$ be a connected undirected graph.~A vertex coloring $f$ of $G$ is an $N_{i}$ -vertex coloring if for each vertex $x$ in $G$ , the number of different colors assigned to $N_{G} (x)$ …

math.CO2022

A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs

Ansong Ma, Yuefang Sun, Xiaoyan Zhang

Let $D$ be a digraph. We define the minimum semi-degree of $D$ as $δ^{0} (D) := min {δ^{+} (D), δ^{-} (D)}$ . Let $k$ be a positive integer, and let $S = {s}$ and $T = \{t_{1}, \d…

math.CO2022

Perfect Out-forests and Steiner Cycle Packing in Digraphs

Yuefang Sun

In this paper, we study the complexity of two types of digraph packing problems: perfect out-forests problem and Steiner cycle packing problem. For the perfect out-forest problem,…

math.CO2022

Steiner Type Packing Problems in Digraphs: A Survey

Yuefang Sun

Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well…

math.CO2022

Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs

Yiling Dong, Gregory Gutin, Yuefang Sun

Let $D = (V, A)$ be a digraph of order $n$ , $S$ a subset of $V$ of size $k$ and $2 \leq k \leq n$ . A strong subgraph $H$ of $D$ is called an $S$ -strong subgraph if $S \subseteq V (H)$ . A p…

Directed Steiner path packing and directed path connectivity

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

Sharp Bounds and Precise Values for the Ni​-Chromatic Number of Graphs

A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs

Perfect Out-forests and Steiner Cycle Packing in Digraphs

Steiner Type Packing Problems in Digraphs: A Survey

Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs

Sharp Bounds and Precise Values for the $N_{i}$ -Chromatic Number of Graphs