Jin Yan

activity

20172020

most citedThe confirmation of a conjecture on disjoint cycles in a graph

1 citations · 1 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2020

Disjoint cycles covering specified vertices in bipartite graphs with partial degrees

Suyun Jiang, Jin Yan

Let $k$ be a positive integer. Let $G$ be a balanced bipartite graph of order $2 n$ with bipartition $(X, Y)$ , and $S$ a subset of $X$ . Suppose that every pair of nonadjacent vertic…

math.CO2020

On directed version of the Sauer-Spender Theorem

Yun Wang, Jin Yan

Let $D = (V, A)$ be a digraph of order $n$ and let $W$ be any subset of $V$ . We define the minimum semi-degree of $W$ in $D$ to be $δ^0(W)=\mbox{min}\{δ^+(W),δ^-(W)\}$, where $δ^{+} (W)$ …

math.CO2018

Partitioning a graph into cycles with a specified number of chords

Shuya Chiba, Suyun Jiang, Jin Yan

For a graph $G$ , let $σ_{2} (G)$ be the minimum degree sum of two non-adjacent vertices in $G$ . A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive verti…

math.CO2017★ 1 cited

The confirmation of a conjecture on disjoint cycles in a graph

Fuhong Ma, Jin Yan

In this paper, we prove the following conjecture proposed by Gould, Hirohata and Keller [Discrete Math. submitted]: Let $G$ be a graph of sufficiently large order. If $σ_t(G) \geq…