Suyun Jiang

According to our database, Suyun Jiang authored at least 13 papers between 2016 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

The bipartite Turán number of independent cycles with different lengths.

Panpan Cheng, Yunshu Gao, Suyun Jiang

Discret. Math., 2026

2025

On the maximum number of r-cliques in graphs free of complete r-partite subgraphs.

József Balogh, Suyun Jiang, Haoran Luo

Discret. Math., 2025

2024

How connectivity affects the extremal number of trees.

Suyun Jiang, Hong Liu, Nika Salia

J. Comb. Theory B, 2024

2023

Disjoint cycles covering specified vertices in bipartite graphs with partial degrees.

Suyun Jiang, Jin Yan

Appl. Math. Comput., 2023

2021

Vertex-disjoint stars in K1, r-free graphs.

Suyun Jiang, Hao Li, Jin Yan

Discret. Appl. Math., 2021

Vertex disjoint copies of K1, 4 in claw-free graphs.

Yun Wang, Suyun Jiang, Jin Yan

Appl. Math. Comput., 2021

2020

Partitioning a graph into cycles with a specified number of chords.

Shuya Chiba, Suyun Jiang, Jin Yan

J. Graph Theory, 2020

Hamiltonicity of edge-chromatic critical graphs.

Yan Cao, Guantao Chen, Suyun Jiang, Huiqing Liu, Fuliang Lu

Discret. Math., 2020

2019

Average degrees of edge-chromatic critical graphs.

Yan Cao, Guantao Chen, Suyun Jiang, Huiqing Liu, Fuliang Lu

Discret. Math., 2019

2017

Partial Degree Conditions and Cycle Coverings in Bipartite Graphs.

Suyun Jiang, Jin Yan

Graphs Comb., 2017

Vertex-disjoint copies of K_{1, t} in K_{1, r}-free graphs.

Suyun Jiang, Shuya Chiba, Shinya Fujita, Jin Yan

Discret. Math., 2017

2016

Vertex-Disjoint Cycles Containing Specified Vertices in a Bipartite Graph.

Shaohua Zhang, Jin Yan, Suyun Jiang

Graphs Comb., 2016

Vertex-disjoint copies of K_{1, 3} in K_{1, r}-free graphs.

Suyun Jiang, Jin Yan

Discret. Math., 2016