Every 3-connected {K1, 3, N1, 2, 3}-free graph is Hamilton-connected. - Zhiquan Hu; Shunzhe Zhang (Graphs Comb., 2016)

Fractional matching preclusion of the restricted HL-graphs. - Shunzhe Zhang; Huiqing Liu; Dong Li; Xiaolan Hu (J. Comb. Optim., 2019)

On g-extra conditional diagnosability of hierarchical cubic networks. - Huiqing Liu; Shunzhe Zhang; Dong Li (Theor. Comput. Sci., 2019)

Hybrid fault diagnosis capability analysis of triangle-free graphs. - Shunzhe Zhang; Huiqing Liu; Xiaolan Hu (Theor. Comput. Sci., 2019)

Long Cycles Passing Through a Linear Forest. - Feifei Song; Shunzhe Zhang (Graphs Comb., 2020)

On g-Extra Conditional Diagnosability of Twisted Hypercubes under MM∗ Model. - Shunzhe Zhang; Dong Li; Huiqing Liu (Int. J. Found. Comput. Sci., 2020)

On the Path Cover Number of Connected Quasi-Claw-Free Graphs. - Huiqing Liu; Jian Lu; Shunzhe Zhang; Xiuyu Zhong (IEEE Access, 2021)

Anti-Ramsey numbers for cycles in the generalized Petersen graphs. - Huiqing Liu; Mei Lu; Shunzhe Zhang (Appl. Math. Comput., 2022)

On the global strong resilience of fault Hamiltonian graphs. - Huiqing Liu; Ruiting Zhang; Shunzhe Zhang (Appl. Math. Comput., 2022)

Spanning trees with at most k leaves in 2-connected K1,r-free graphs. - Guantao Chen; Yuan Chen; Zhiquan Hu; Shunzhe Zhang (Appl. Math. Comput., 2023)

The perfect matching and tight Hamilton cycle decomposition of complete n-balanced mk-partite k-uniform hypergraphs. - Taijiang Jiang; Qiang Sun; Shunzhe Zhang; Chao Zhang 080 (Discret. Math., 2023)