Остановите войну!
for scientists:
default search action
Yongtang Shi
- > Home > Persons > Yongtang Shi
Publications
- 2018
- [j51]Ran Gu, Xueliang Li, Zhongmei Qin, Yongtang Shi, Kang Yang:
Non-jumping numbers for 5-uniform hypergraphs. Appl. Math. Comput. 317: 234-251 (2018) - 2016
- [j28]Ran Gu, Xueliang Li, Yuejian Peng, Yongtang Shi:
Some Motzkin-Straus type results for non-uniform hypergraphs. J. Comb. Optim. 31(1): 223-238 (2016) - 2015
- [j26]Shasha Li, Xueliang Li, Yongtang Shi:
Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs. Appl. Math. Comput. 258: 155-161 (2015) - [j21]Xueliang Li, Jing Ma, Yongtang Shi, Jun Yue:
Note on a Turan-type problem on distances. Ars Comb. 119: 211-219 (2015) - [j20]Matthias Dehmer, Xueliang Li, Yongtang Shi:
Connections between generalized graph entropies and graph energy. Complex. 21(1): 35-41 (2015) - [j17]Xueliang Li, Yongtang Shi, Martin Trinks:
Polynomial reconstruction of the matching polynomial. Electron. J. Graph Theory Appl. 3(1): 27-34 (2015) - 2014
- [j15]Xiaolong Huang, Xueliang Li, Yongtang Shi, Jun Yue, Yan Zhao:
Rainbow connections for outerplanar graphs with diameter 2 and 3. Appl. Math. Comput. 242: 277-280 (2014) - 2013
- [j10]Xueliang Li, Yongtang Shi:
On the rainbow vertex-connection. Discuss. Math. Graph Theory 33(2): 307-313 (2013) - [j9]Xueliang Li, Yongtang Shi, Yuefang Sun:
Rainbow Connections of Graphs: A Survey. Graphs Comb. 29(1): 1-38 (2013) - [j8]Xueliang Li, Yongtang Shi:
Rainbow Connection in 3-Connected Graphs. Graphs Comb. 29(5): 1471-1475 (2013) - 2011
- [j7]Shasha Li, Xueliang Li, Yongtang Shi:
The minimal size of a graph with generalized connectivity κ3 = 2. Australas. J Comb. 51: 209-220 (2011) - [j6]Xueliang Li, Yongtang Shi:
On the diameter and inverse degree. Ars Comb. 101: 481-487 (2011) - [j5]Bofeng Huo, Xueliang Li, Yongtang Shi:
Complete solution to a conjecture on the maximal energy of unicyclic graphs. Eur. J. Comb. 32(5): 662-673 (2011) - [j4]Lily Chen, Xueliang Li, Yongtang Shi:
The complexity of determining the rainbow vertex-connection of a graph. Theor. Comput. Sci. 412(35): 4531-4535 (2011) - [i2]Lily Chen, Xueliang Li, Yongtang Shi:
The complexity of determining the rainbow vertex-connection of graphs. CoRR abs/1101.3126 (2011) - [i1]Xiaolong Huang, Xueliang Li, Yongtang Shi:
Rainbow connections for planar graphs and line graphs. CoRR abs/1110.3147 (2011) - 2010
- [j3]Xueliang Li, Yongtang Shi:
On a relation between the Randic index and the chromatic number. Discret. Math. 310(17-18): 2448-2451 (2010) - 2007
- [j2]Yumei Hu, Xueliang Li, Yongtang Shi, Tianyi Xu:
Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index. Discret. Appl. Math. 155(8): 1044-1054 (2007) - [j1]Xueliang Li, Yongtang Shi:
Corrections of proofs for Hansen and Mélot's two theorems. Discret. Appl. Math. 155(17): 2365-2370 (2007)
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-04-07 22:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint