Suyun Jiang

activity

20172020

collaborators

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

Average degrees of edge-chromatic critical graphs

Yan Cao, Guantao Chen, Suyun Jiang +2

Given a graph $G$ , denote by $Δ$ , $d ˉ$ and $χ^{'}$ the maximum degree, the average degree and the chromatic index of $G$ , respectively. A simple graph $G$ is called {\it ed…