On a conjecture on k-walks of graphs. - Zemin Jin; Xueliang Li 001 (Australas. J Comb., 2004)

The complexity for partitioning graphs by monochromatic trees, cycles and paths. - Zemin Jin; Xueliang Li 001 (Int. J. Comput. Math., 2004)

Contractible Cliques in k-Connected Graphs. - Xiaolong Huang; Zemin Jin; Xingxing Yu; Xiaoyan Zhang (Graphs Comb., 2006)

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. - Zemin Jin; Mikio Kano; Xueliang Li 001; Bing Wei 001 (J. Comb. Optim., 2006)

On the k-path cover problem for cacti. - Zemin Jin; Xueliang Li 001 (Theor. Comput. Sci., 2006)

Generalization of matching extensions in graphs (II). - Zemin Jin; Huifang Yan; Qinglin Yu (Discret. Appl. Math., 2007)

Contractible subgraphs in k-connected graphs. - Zemin Jin; Xingxing Yu; Xiaoyan Zhang (J. Graph Theory, 2007)

Heterochromatic tree partition numbers for complete bipartite graphs. - He Chen 002; Zemin Jin; Xueliang Li 001; Jianhua Tu (Discret. Math., 2008)

Graphs with the second largest number of maximal independent sets. - Zemin Jin; Xueliang Li 001 (Discret. Math., 2008)

Trees with the second and third largest number of maximal independent sets. - Zemin Jin; Sherry H. F. Yan (Ars Comb., 2009)

Anti-Ramsey Numbers for Graphs with Independent Cycles. - Zemin Jin; Xueliang Li 001 (Electron. J. Comb., 2009)

Bipartite rainbow numbers of matchings. - Xueliang Li 001; Jianhua Tu; Zemin Jin (Discret. Math., 2009)

Heterochromatic tree partition problem in complete tripartite graphs. - Zemin Jin; Shili Wen; Shujun Zhou (Discret. Math., 2012)

Edge-colorings of complete bipartite graphs without large rainbow trees. - Zemin Jin; Lifen Li (Ars Comb., 2013)

Heterochromatic tree partition number in complete multipartite graphs. - Zemin Jin; Peipei Zhu (J. Comb. Optim., 2014)

An FPT algorithm for the vertex cover P4 problem. - Jianhua Tu; Zemin Jin (Discret. Appl. Math., 2016)

Coupon coloring of cographs. - He Chen 002; Zemin Jin (Appl. Math. Comput., 2017)

Anti-Ramsey numbers for matchings in 3-regular bipartite graphs. - Zemin Jin (Appl. Math. Comput., 2017)

On total rainbow k-connected graphs. - Yuefang Sun; Zemin Jin; Fengwei Li (Appl. Math. Comput., 2017)

On (2k+1, 2k+3)-core partitions with distinct parts. - Sherry H. F. Yan; Guizhi Qin; Zemin Jin; Robin D. P. Zhou (Discret. Math., 2017)

Anti-Ramsey numbers for matchings in regular bipartite graphs. - Zemin Jin; Oothan Nweit; Kaijun Wang; Yuling Wang (Discret. Math. Algorithms Appl., 2017)

Extremal coloring for the anti-Ramsey problem of matchings in complete graphs. - Zemin Jin; Yuefang Sun; Sherry H. F. Yan; Yuping Zang (J. Comb. Optim., 2017)

Anti-Ramsey coloring for matchings in complete bipartite graphs. - Zemin Jin; Yuping Zang (J. Comb. Optim., 2017)

Rainbow number of matchings in planar graphs. - Zemin Jin; Kun Ye (Discret. Math., 2018)

Large rainbow matchings in semi-strong edge-colorings of graphs. - Zemin Jin; Kun Ye; He Chen 002; Yuefang Sun (Discret. Math. Algorithms Appl., 2018)

On two generalized connectivities of graphs. - Zemin Jin; Fengwei Li; Yuefang Sun (Discuss. Math. Graph Theory, 2018)

Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number. - Zemin Jin; Yuefang Sun; Jianhua Tu (Discuss. Math. Graph Theory, 2018)

Rainbow matchings in edge-colored complete split graphs. - Zemin Jin; Kecai Ye; Yuefang Sun; He Chen 002 (Eur. J. Comb., 2018)

Rainbow triangles in edge-colored Kneser graphs. - Zemin Jin; Fang Wang; Huaping Wang; Bihong Lv (Appl. Math. Comput., 2020)

Extremal graphs with maximum monochromatic connectivity. - Zemin Jin; Xueliang Li 001; Yirong Yang (Discret. Math., 2020)

Multicolorful connectivity of trees. - Zemin Jin; Xueyao Gui; Kaijun Wang (Appl. Math. Comput., 2021)

Anti-Ramsey number of matchings in a hypergraph. - Zemin Jin (Discret. Math., 2021)

The minimum size of a graph with given tree connectivity. - Zemin Jin; Bin Sheng 002; Yuefang Sun (Discuss. Math. Graph Theory, 2021)

Anti-Ramsey Number of Triangles in Complete Multipartite Graphs. - Zemin Jin; Kangyun Zhong; Yuefang Sun (Graphs Comb., 2021)

Rainbow matchings in an edge-colored planar bipartite graph. - Zemin Jin; Huawei Ma; Rui Yu (Appl. Math. Comput., 2022)

Minimally strong subgraph (k, ℓ)-arc-connected digraphs. - Yuefang Sun; Zemin Jin (Discuss. Math. Graph Theory, 2022)

Computing the anti-Ramsey number for trees in complete tripartite graph. - Zemin Jin; Yite Wang; Huawei Ma; Huaping Wang (Appl. Math. Comput., 2023)

Semicomplete compositions of digraphs. - Yuefang Sun; Zemin Jin (Discret. Math., 2023)

Rainbow disjoint union of P4 and a matching in complete graphs. - Zemin Jin; Qing Jie; Zhenxin Cao (Appl. Math. Comput., 2024)

Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs. - Zemin Jin; Weijia Zhou; Ting Yu; Yuefang Sun (Discret. Math., 2024)

Rainbow disjoint union of clique and matching in edge-colored complete graph. - Zemin Jin; Junqi Gu (Discuss. Math. Graph Theory, 2024)

Anti-Ramsey number of matchings in outerplanar graphs. - Zemin Jin; Rui Yu; Yuefang Sun (Discret. Appl. Math., 2024)

Rainbow independent triangles in complete split graphs. - Q. Wang; Zemin Jin (Appl. Math. Comput., 2025)

Rainbow short linear forests in edge-colored complete graph. - Menglu He; Zemin Jin (Discret. Appl. Math., 2025)

Rainbow forest consisting of short paths in Kn. - Qing Jie; Menglu He; Zemin Jin (Discret. Appl. Math., 2025)

A heuristic algorithm for rainbow matchings and its application in rainbow Ramsey number for matchings. - Zemin Jin (Discret. Appl. Math., 2025)

Perfect out-forest problem and directed Steiner cycle packing problem. - Yuefang Sun; Zemin Jin (Discret. Appl. Math., 2025)