default search action
Zheng Yan 0006
Person information
- affiliation: Yangtze University, Jingzhou, China
- affiliation (former): Ibaraki University, Hitachi, Ibaraki, Japan
Other persons with the same name
- Zheng Yan — disambiguation page
- Zheng Yan 0001
— University of Technology Sydney, Centre for Artificial Intelligence, Broadway, NSW, Australia (and 2 more)
- Zheng Yan 0002
- Zheng Yan 0003
- Zheng Yan 0004 (aka: Zheng John Yan) — Jet.com/Walmart Labs, Hoboken, NJ, USA
- Zheng Yan 0005
- Zheng Yan 0007
- Zheng Yan 0008 — Huawei Technologies Co., Ltd., Shenzhen, China
- Zheng Yan 0009 — Huaqiao University, Xiamen, Fujian, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j11]Mikio Kano, Zheng Yan:
Strong Tutte type conditions and factors of graphs. Discuss. Math. Graph Theory 40(4): 1057-1065 (2020)
2010 – 2019
- 2019
- [j10]Xiang-Jun Li
On conditional fault tolerance of hierarchical cubic networks. Theor. Comput. Sci. 761: 1-6 (2019) - 2018
- [j9]Zheng Yan, Masao Tsugaki:
On 3-stable number conditions in n-connected claw-free graphs. Discret. Math. 341(9): 2499-2507 (2018) - 2017
- [j8]Zheng Yan:
Independence Number and k-Trees of Graphs. Graphs Comb. 33(5): 1089-1093 (2017) - [j7]Xiang-Jun Li
On fault tolerance of (n, k)-star networks. Theor. Comput. Sci. 704: 82-86 (2017) - 2016
- [j6]Mikio Kano, Zheng Yan:
Spanning trees with bounded degrees and leaves. Discret. Math. 339(5): 1583-1586 (2016) - [j5]Yoshimi Egawa, Mikio Kano, Zheng Yan:
(1, f)-Factors of Graphs with Odd Property. Graphs Comb. 32(1): 103-110 (2016) - [j4]Xiang-Jun Li
Embedded connectivity of recursive networks. Theor. Comput. Sci. 653: 79-86 (2016) - 2015
- [j3]Mikio Kano, Zheng Yan:
Spanning Trees Whose Stems are Spiders. Graphs Comb. 31(6): 1883-1887 (2015) - 2014
- [j2]Mikio Kano, Zheng Yan:
Spanning trees whose stems have at most k leaves. Ars Comb. 117: 417-424 (2014) - [j1]Yoshimi Egawa, Mikio Kano, Zheng Yan:
Star-cycle factors of graphs. Discuss. Math. Graph Theory 34(1): 193-198 (2014) - 2012
- [c1]Mikio Kano, Tomoki Yamashita, Zheng Yan:
Spanning Caterpillars Having at Most k Leaves. TJJCCGG 2012: 95-100
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-12-12 21:00 CET 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: