Shunzhe Zhang

According to our database, Shunzhe Zhang authored at least 11 papers between 2016 and 2023.

Collaborative distances:

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

2023

The perfect matching and tight Hamilton cycle decomposition of complete <i>n</i>-balanced <i>mk</i>-partite <i>k</i>-uniform hypergraphs.

Taijiang Jiang, Qiang Sun, Shunzhe Zhang, Chao Zhang

Discret. Math., December, 2023

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., May, 2023

2022

On the global strong resilience of fault Hamiltonian graphs.

Huiqing Liu, Ruiting Zhang, Shunzhe Zhang

Appl. Math. Comput., 2022

Anti-Ramsey numbers for cycles in the generalized Petersen graphs.

Huiqing Liu, Mei Lu, Shunzhe Zhang

Appl. Math. Comput., 2022

2021

On the Path Cover Number of Connected Quasi-Claw-Free Graphs.

Huiqing Liu, Jian Lu, Shunzhe Zhang, Xiuyu Zhong

IEEE Access, 2021

2020

On g-Extra Conditional Diagnosability of Twisted Hypercubes under MM∗ Model.

Shunzhe Zhang, Dong Li, Huiqing Liu

Int. J. Found. Comput. Sci., 2020

Long Cycles Passing Through a Linear Forest.

Feifei Song, Shunzhe Zhang

Graphs Comb., 2020

2019

Hybrid fault diagnosis capability analysis of triangle-free graphs.

Shunzhe Zhang, Huiqing Liu, Xiaolan Hu

Theor. Comput. Sci., 2019

On <i>g</i>-extra conditional diagnosability of hierarchical cubic networks.

Huiqing Liu, Shunzhe Zhang, Dong Li

Theor. Comput. Sci., 2019

Fractional matching preclusion of the restricted HL-graphs.

Shunzhe Zhang, Huiqing Liu, Dong Li, Xiaolan Hu

J. Comb. Optim., 2019

2016

Every 3-connected {K_{1, 3}, N_{1, 2, 3}}-free graph is Hamilton-connected.

Zhiquan Hu, Shunzhe Zhang

Graphs Comb., 2016