Vertex-disjoint copies of K1, 3 in K1, r-free graphs. - Suyun Jiang; Jin Yan (Discret. Math., 2016)

Vertex-Disjoint Cycles Containing Specified Vertices in a Bipartite Graph. - Shaohua Zhang; Jin Yan; Suyun Jiang (Graphs Comb., 2016)

Vertex-disjoint copies of K1, t in K1, r-free graphs. - Suyun Jiang; Shuya Chiba; Shinya Fujita 001; Jin Yan (Discret. Math., 2017)

Partial Degree Conditions and Cycle Coverings in Bipartite Graphs. - Suyun Jiang; Jin Yan (Graphs Comb., 2017)

Average degrees of edge-chromatic critical graphs. - Yan Cao 001; Guantao Chen; Suyun Jiang; Huiqing Liu; Fuliang Lu (Discret. Math., 2019)

Hamiltonicity of edge-chromatic critical graphs. - Yan Cao 001; Guantao Chen; Suyun Jiang; Huiqing Liu; Fuliang Lu (Discret. Math., 2020)

Partitioning a graph into cycles with a specified number of chords. - Shuya Chiba; Suyun Jiang; Jin Yan (J. Graph Theory, 2020)

Vertex disjoint copies of K1, 4 in claw-free graphs. - Yun Wang; Suyun Jiang; Jin Yan (Appl. Math. Comput., 2021)

Vertex-disjoint stars in K1, r-free graphs. - Suyun Jiang; Hao Li 002; Jin Yan (Discret. Appl. Math., 2021)

Disjoint cycles covering specified vertices in bipartite graphs with partial degrees. - Suyun Jiang; Jin Yan (Appl. Math. Comput., 2023)

How connectivity affects the extremal number of trees. - Suyun Jiang; Hong Liu; Nika Salia (J. Comb. Theory B, 2024)

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)