default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanmei Hong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Junhao Zhang, Qinghai Liu
, Yanmei Hong:
Gallai's conjecture for 3-degenerated graphs. Discret. Math. 347(7): 114057 (2024)- 2023
- [j18]Haiyang Liu, Qinghai Liu, Yanmei Hong:
Connectivity keeping trees in 3-connected or 3-edge-connected graphs. Discret. Math. 346(12): 113679 (2023) - 2022
- [j17]Yanmei Hong, Qinghai Liu:
Mader's conjecture for graphs with small connectivity. J. Graph Theory 101(3): 379-388 (2022) - 2021
- [j16]Yanmei Hong, Qinghai Liu, Changhong Lu, Qingjie Ye:
Connectivity keeping caterpillars and spiders in 2-connected graphs. Discret. Math. 344(3): 112236 (2021) - 2020
- [j15]Yanmei Hong, Qinghai Liu, Nannan Yu:
Edge decomposition of connected claw-free cubic graphs. Discret. Appl. Math. 284: 246-250 (2020)
2010 – 2019
- 2019
- [j14]Qinghai Liu, Yanmei Hong:
The reliability of lexicographic product digraphs. Appl. Math. Comput. 358: 449-454 (2019) - 2017
- [j13]Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Characterization of Digraphic Sequences with Strongly Connected Realizations. J. Graph Theory 84(2): 191-201 (2017) - 2016
- [j12]Yanmei Hong, Xiaofeng Gu, Hong-Jian Lai, Qinghai Liu:
Fractional spanning tree packing, forest covering and eigenvalues. Discret. Appl. Math. 213: 219-223 (2016) - [j11]Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Ore-type degree condition of supereulerian digraphs. Discret. Math. 339(8): 2042-2050 (2016) - 2015
- [j10]Yanmei Hong, Liying Kang, Xingxing Yu:
Nonseparating Cycles Avoiding Specific Vertices. J. Graph Theory 80(4): 253-267 (2015) - 2014
- [j9]Genghua Fan, Yanmei Hong, Qinghai Liu:
Ore's condition for completely independent spanning trees. Discret. Appl. Math. 177: 95-100 (2014) - [j8]Yanmei Hong, Hong-Jian Lai, Qinghai Liu:
Supereulerian digraphs. Discret. Math. 330: 87-95 (2014) - 2013
- [j7]Yanmei Hong, Hong-Jian Lai:
Non-separating subgraphs. Discret. Math. 313(4): 391-396 (2013) - 2012
- [j6]Yanmei Hong, Jixiang Meng, Zhao Zhang:
Edge fault tolerance of graphs with respect to super edge connectivity. Discret. Appl. Math. 160(4-5): 579-587 (2012) - [j5]Yanmei Hong, Liying Kang:
Backup 2-center on interval graphs. Theor. Comput. Sci. 445: 25-35 (2012)
2000 – 2009
- 2009
- [j4]Qinghai Liu, Yanmei Hong, Zhao Zhang:
Minimally 3-restricted edge connected graphs. Discret. Appl. Math. 157(4): 685-690 (2009) - [j3]Yanmei Hong, Zhao Zhang, Qinghai Liu:
Edges of degree k in minimally restricted k-edge connected graphs. Discret. Math. 309(13): 4448-4455 (2009) - [j2]Yanmei Hong, Zhao Zhang:
Vertex fault tolerance of optimal-kappa graphs and super-kappa graphs. Inf. Process. Lett. 109(20): 1151-1155 (2009) - 2008
- [j1]Yanmei Hong, Qinghai Liu, Zhao Zhang:
Minimally restricted edge connected graphs. Appl. Math. Lett. 21(8): 820-823 (2008)
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-03 00:08 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:
