default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLianzhu Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Xiaoxia Wu, Fuliang Lu, Lianzhu Zhang:
Removable Edges in Claw-Free Bricks. Graphs Comb. 40(3): 43 (2024)- 2022
- [i1]Mingzu Zhang, Zhaoxia Tian, Lianzhu Zhang:
A novel view: edge isoperimetric methods and reliability evaluation of several kinds of conditional edge-connectivity of interconnection networks. CoRR abs/2203.12916 (2022) - 2021
- [j25]Guantao Chen, Xing Feng, Fuliang Lu, Cláudio Leonardo Lucchesi, Lianzhu Zhang:
Laminar tight cuts in matching covered graphs. J. Comb. Theory B 150: 177-194 (2021) - [c1]Mingzu Zhang, Zhaoxia Tian, Lianzhu Zhang:
A Novel View: Edge is Operimetric Methods and Reliability Evaluation of Several kinds of Conditional Edge-connectivity of Interconnection Networks. QRS Companion 2021: 849-860 - 2020
- [j24]Fuliang Lu, Nishad Kothari
, Xing Feng, Lianzhu Zhang:
Equivalence classes in matching covered graphs. Discret. Math. 343(8): 111945 (2020)
2010 – 2019
- 2019
- [j23]Xiaoxia Wu, Lianzhu Zhang:
On structural properties of ABC-minimal chemical trees. Appl. Math. Comput. 362 (2019) - [j22]Guantao Chen, Xing Feng, Fuliang Lu, Lianzhu Zhang:
Disjoint Odd Cycles in Cubic Solid Bricks. SIAM J. Discret. Math. 33(1): 393-397 (2019) - 2018
- [j21]Xing Feng, Lianzhu Zhang, Mingzu Zhang:
Enumeration of perfect matchings of lattice graphs by Pfaffians. Appl. Math. Comput. 338: 412-420 (2018) - [j20]Xing Feng, Lianzhu Zhang, Mingzu Zhang:
An O(|E(G)|2) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs. J. Comb. Optim. 35(3): 740-753 (2018) - [j19]Mingzu Zhang, Lianzhu Zhang, Xing Feng, Hong-Jian Lai:
An O(log2(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes. IEEE Trans. Reliab. 67(1): 297-307 (2018) - 2017
- [j18]Xiaoxia Wu, Lianzhu Zhang, Haiyan Chen:
Spanning trees and recurrent configurations of a graph. Appl. Math. Comput. 314: 25-30 (2017) - [j17]Fuliang Lu, Lianzhu Zhang:
A Conjecture of Norine and Thomas for Abelian Cayley Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j16]Jiangxu Kong, Lianzhu Zhang:
A note on the surviving rate of 1-planar graphs. Discret. Math. 340(5): 1074-1079 (2017) - [j15]Xing Feng, Lianzhu Zhang, Mingzu Zhang:
A Sufficient Condition for Pfaffian Graphs on the Torus. Graphs Comb. 33(5): 1249-1260 (2017) - 2016
- [j14]Mingzu Zhang, Lianzhu Zhang, Xing Feng:
Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes. Theor. Comput. Sci. 615: 71-77 (2016) - 2015
- [j13]Fuliang Lu, Lianzhu Zhang, Yan Wang:
The Pfaffian property of circulant graphs. Discret. Appl. Math. 181: 185-192 (2015) - 2014
- [j12]Lianzhu Zhang, Weifan Wang, Ko-Wei Lih:
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph. Discret. Appl. Math. 162: 348-354 (2014) - [j11]Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang:
The surviving rate of digraphs. Discret. Math. 334: 13-19 (2014) - [j10]Meirun Chen, Xiaofeng Guo, Hao Li, Lianzhu Zhang:
Total chromatic number of generalized Mycielski graphs. Discret. Math. 334: 48-51 (2014) - [j9]Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang:
Structural properties and surviving rate of planar graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - [j8]Fuliang Lu, Lianzhu Zhang:
The Pfaffian property of Cartesian products of graphs. J. Comb. Optim. 27(3): 530-540 (2014) - [j7]Fenggen Lin, Lianzhu Zhang, Fuliang Lu:
The Cubic Vertices of Minimal Bricks. J. Graph Theory 76(1): 20-33 (2014) - [j6]Fenggen Lin, Lianzhu Zhang, Fuliang Lu:
Pfaffian orientations for a type of bipartite graph. Theor. Comput. Sci. 527: 97-101 (2014) - 2012
- [j5]Fenggen Lin, Lianzhu Zhang, Fuliang Lu:
Perfect Matchings and Genus of Some Cartesian Products of Graphs. Discret. Math. Algorithms Appl. 4(2) (2012) - [j4]Weifan Wang, Jiangxu Kong, Lianzhu Zhang:
The 2-surviving rate of planar graphs without 4-cycles. Theor. Comput. Sci. 457: 158-165 (2012) - 2010
- [j3]Fuliang Lu, Lianzhu Zhang, Fenggen Lin:
Enumeration of Perfect Matchings of a Type of Quadratic Lattice on the Torus. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2002
- [j2]Lianzhu Zhang, Feng Tian:
Independence and connectivity in 3-domination-critical graphs. Discret. Math. 259(1-3): 227-236 (2002)
1990 – 1999
- 1997
- [j1]Guifang Wang, Lianzhu Zhang:
The structure of max lambda-min m+1 graphs used in the design of reliable networks. Networks 30(4): 231-242 (1997)
Coauthor Index
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-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
