![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Shunzhe Zhang
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Guantao Chen, Yuan Chen, Zhiquan Hu, Shunzhe Zhang:
Spanning trees with at most k leaves in 2-connected K1,r-free graphs. Appl. Math. Comput. 445: 127842 (2023) - [j10]Taijiang Jiang, Qiang Sun, Shunzhe Zhang, Chao Zhang
:
The perfect matching and tight Hamilton cycle decomposition of complete n-balanced mk-partite k-uniform hypergraphs. Discret. Math. 346(12): 113631 (2023) - 2022
- [j9]Huiqing Liu, Ruiting Zhang, Shunzhe Zhang
:
On the global strong resilience of fault Hamiltonian graphs. Appl. Math. Comput. 418: 126841 (2022) - [j8]Huiqing Liu, Mei Lu, Shunzhe Zhang:
Anti-Ramsey numbers for cycles in the generalized Petersen graphs. Appl. Math. Comput. 430: 127277 (2022) - 2021
- [j7]Huiqing Liu, Jian Lu, Shunzhe Zhang
, Xiuyu Zhong:
On the Path Cover Number of Connected Quasi-Claw-Free Graphs. IEEE Access 9: 37086-37090 (2021) - 2020
- [j6]Feifei Song, Shunzhe Zhang
:
Long Cycles Passing Through a Linear Forest. Graphs Comb. 36(3): 639-664 (2020) - [j5]Shunzhe Zhang
, Dong Li, Huiqing Liu:
On g-Extra Conditional Diagnosability of Twisted Hypercubes under MM∗ Model. Int. J. Found. Comput. Sci. 31(4): 445-459 (2020)
2010 – 2019
- 2019
- [j4]Shunzhe Zhang
, Huiqing Liu, Dong Li, Xiaolan Hu
:
Fractional matching preclusion of the restricted HL-graphs. J. Comb. Optim. 38(4): 1143-1154 (2019) - [j3]Huiqing Liu, Shunzhe Zhang
, Dong Li:
On g-extra conditional diagnosability of hierarchical cubic networks. Theor. Comput. Sci. 790: 66-79 (2019) - [j2]Shunzhe Zhang
, Huiqing Liu, Xiaolan Hu:
Hybrid fault diagnosis capability analysis of triangle-free graphs. Theor. Comput. Sci. 799: 59-70 (2019) - 2016
- [j1]Zhiquan Hu, Shunzhe Zhang
:
Every 3-connected {K1, 3, N1, 2, 3}-free graph is Hamilton-connected. Graphs Comb. 32(2): 685-705 (2016)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint