default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeiqin Wei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Zhiqiang Ma, Yaping Mao
, Ingo Schiermeyer, Meiqin Wei:
Complete bipartite graphs without small rainbow subgraphs. Discret. Appl. Math. 346: 248-262 (2024)- [j12]Zhiqiang Ma, Fengyun Ren, Meiqin Wei, Gemaji Bao:
Sufficient Conditions of (Isolated) Toughness and Binding Number for the Existence of Component Factors. J. Interconnect. Networks 24(2): 2350013:1-2350013:14 (2024) - 2023
- [j11]Jiannan Zhou, Zhihui Li, Yaping Mao, Meiqin Wei:
Ramsey and Gallai-Ramsey numbers for the union of paths and stars. Discret. Appl. Math. 325: 297-308 (2023) - [j10]Weizhen Chen, Meng Ji, Yaping Mao, Meiqin Wei:
Complete bipartite graphs without small rainbow stars. Discret. Appl. Math. 340: 14-20 (2023) - 2022
- [j9]Meiqin Wei, Changxiang He, Yaping Mao, Xiangqian Zhou:
Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels. Discret. Math. 345(11): 113092 (2022) - [j8]Meiqin Wei, Jun Yue, Lily Chen:
The effect of vertex and edge deletion on the edge metric dimension of graphs. J. Comb. Optim. 44(1): 331-342 (2022) - [j7]Tianyu Liu, Wang Zhu, Meiqin Wei:
A many-objective optimization algorithm using a two-space interactive evolutionary framework. Swarm Evol. Comput. 75: 101185 (2022) - 2020
- [j6]Jun Yue, Yiping Zhu, Meiqin Wei:
The annihilation number and the total domination number of a tree-like graph. Appl. Math. Comput. 380: 125240 (2020)
2010 – 2019
- 2018
- [j5]Jun Yue, Meiqin Wei, Min Li, Guodong Liu:
On the double Roman domination of graphs. Appl. Math. Comput. 338: 669-675 (2018) - [j4]Xueliang Li, Colton Magnant, Meiqin Wei, Xiaoyu Zhu:
Generalized rainbow connection of graphs and their complements. Discuss. Math. Graph Theory 38(2): 371-384 (2018) - 2017
- [j3]Yongtang Shi, Meiqin Wei, Jun Yue, Yan Zhao:
Coupon coloring of some special graphs. J. Comb. Optim. 33(1): 156-164 (2017) - 2015
- [j2]Xueliang Li, Zhongmei Qin, Meiqin Wei, Ivan Gutman, Matthias Dehmer:
Novel inequalities for generalized graph entropies - Graph energies and topological indices. Appl. Math. Comput. 259: 470-479 (2015) - [j1]Xueliang Li, Meiqin Wei, Jun Yue:
Proper connection number and connected dominating sets. Theor. Comput. Sci. 607: 480-487 (2015) - [c1]Xueliang Li, Yaping Mao, Meiqin Wei, Ruihu Li:
Searching for (near) Optimal Codes. COCOA 2015: 521-536 - [i3]Xueliang Li, Meiqin Wei:
A survey of recent results in (generalized) graph entropies. CoRR abs/1505.04658 (2015) - 2014
- [i2]Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei:
Formally self-dual linear binary codes from circulant graphs. CoRR abs/1402.6399 (2014) - [i1]Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei:
Additive codes over $GF(4)$ from circulant graphs. CoRR abs/1403.7933 (2014)
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-09-15 00:43 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:
