default search action
Zhongmei Qin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j19]Rui Li, Yuede Ma, Zhongmei Qin, Yingping Zhao:
Note on the anti-Ramsey number for matching in hypercubes. Appl. Math. Comput. 489: 129154 (2025) - 2021
- [j18]Zhongmei Qin, Shasha Li, Yongxin Lan, Jun Yue:
Rainbow numbers for paths in planar graphs. Appl. Math. Comput. 397: 125918 (2021) - [j17]Zhongmei Qin, Junxue Zhang:
Extremal stretch of proper-walk coloring of graphs. Appl. Math. Comput. 405: 126240 (2021) - [j16]Zhongmei Qin
, Yongxin Lan, Yongtang Shi
Exact rainbow numbers for matchings in plane triangulations. Discret. Math. 344(4): 112301 (2021) - [j15]Zenan Du, Fenjin Liu, Shunyi Liu, Zhongmei Qin:
Graphs with n-1 main eigenvalues. Discret. Math. 344(7): 112397 (2021) - [j14]Shasha Li, Zhongmei Qin
On Tree-Connectivity and Path-Connectivity of Graphs. Graphs Comb. 37(6): 2521-2533 (2021) - 2020
- [j13]Wei Li, Zhongmei Qin, Yao Wang:
Enumeration of permanental sums of lattice graphs. Appl. Math. Comput. 370 (2020) - [j12]Zhongmei Qin, Hui Lei, Shasha Li:
Rainbow numbers for small graphs in planar graphs. Appl. Math. Comput. 371 (2020)
2010 – 2019
- 2019
- [j11]Zhongmei Qin, Yongxin Lan, Yongtang Shi:
Improved bounds for rainbow numbers of matchings in plane triangulations. Discret. Math. 342(1): 221-225 (2019) - [j10]Yongxin Lan, Henry Liu, Zhongmei Qin, Yongtang Shi
Degree powers in graphs with a forbidden forest. Discret. Math. 342(3): 821-835 (2019) - [j9]Yongxin Lan, Zhongmei Qin, Yongtang Shi:
The Turán number of 2P7. Discuss. Math. Graph Theory 39(4): 805-814 (2019) - [j8]Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant:
Minimum degree condition for proper connection number 2. Theor. Comput. Sci. 774: 44-50 (2019) - 2018
- [j7]Ran Gu, Xueliang Li, Zhongmei Qin, Yongtang Shi, Kang Yang:
Non-jumping numbers for 5-uniform hypergraphs. Appl. Math. Comput. 317: 234-251 (2018) - [j6]Hong Chang, Xueliang Li, Colton Magnant, Zhongmei Qin:
The (k , ℓ)-proper index of graphs. J. Comb. Optim. 36(2): 458-471 (2018) - 2017
- [j5]Zhongmei Qin, Jianfeng Wang, Kang Yang:
Oriented Bicyclic Graphs with the First Five Large Skew Energies. Ars Comb. 135: 265-282 (2017) - [j4]Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant, Kenta Ozeki
On two conjectures about the proper connection number of graphs. Discret. Math. 340(9): 2217-2222 (2017) - 2016
- [j3]Wei Li, Zhongmei Qin, Heping Zhang
Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial. Appl. Math. Comput. 291: 30-38 (2016) - [j2]Ran Gu, Xueliang Li, Zhongmei Qin:
Proper connection number of random graphs. Theor. Comput. Sci. 609: 336-343 (2016) - 2015
- [j1]Xueliang Li, Zhongmei Qin, Meiqin Wei, Ivan Gutman
Novel inequalities for generalized graph entropies - Graph energies and topological indices. Appl. Math. Comput. 259: 470-479 (2015)
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-11-19 20:49 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: