default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYufa Shen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j17]Yufa Shen, Jingrui Dong, Guoping Zheng, Lingling Guo:
The radio number of standard caterpillars. Ars Comb. 125: 257-269 (2016)- 2011
- [j16]Yufa Shen, Jun Guo, Xin Xiao, Qing Tang:
Nearly antipodal chromatc number of even paths. Ars Comb. 99: 217-224 (2011) - 2010
- [j15]Zuo-Li Chen, Jin-Feng Lv, Yufa Shen, Guoping Zheng:
On choosability of complete multipartite graphs K4, 3*t, 2*(k-2t-2), 1*(t+1). Discuss. Math. Graph Theory 30(2): 237-244 (2010)
2000 – 2009
- 2009
- [j14]Yufa Shen, Wenjie He, Guoping Zheng, Yanpo Li:
Ohba's conjecture is true for graphs with independence number at most three. Appl. Math. Lett. 22(6): 938-942 (2009) - [j13]Yanning Wang, Yufa Shen, Guoping Zheng, Wenjie He:
On Uniquely 4-List Colorable Complete Multipartite Graphs. Ars Comb. 93 (2009) - 2008
- [j12]Yufa Shen, Yanming Wang, Wenjie He, Yongqiang Zhao:
On Uniquely List Colorable Complete Multipartite Graphs. Ars Comb. 88 (2008) - [j11]Yufa Shen, Wenjie He, Xue Li, Donghong He, Xiaojing Yang:
On hamiltonian colorings for some graphs. Discret. Appl. Math. 156(15): 3028-3034 (2008) - [j10]Yufa Shen, Wenjie He, Guoping Zheng, Yanning Wang, Lingmin Zhang:
On choosability of some complete multipartite graphs and Ohba's conjecture. Discret. Math. 308(1): 136-143 (2008) - [j9]Wenjie He, Wenjing Miao, Yufa Shen:
Another proof of the 5-choosability of K5-minor-free graphs. Discret. Math. 308(17): 4024-4026 (2008) - [j8]Yufa Shen, Guoping Zheng, Wenjie He, Yongqiang Zhao:
Structural properties and edge choosability of planar graphs without 4-cycles. Discret. Math. 308(23): 5789-5794 (2008) - [j7]Wenjie He, Lingmin Zhang, Daniel W. Cranston
, Yufa Shen, Guoping Zheng:
Choice number of complete multipartite graphs K3*3, 2*(k-5), 1*2 and K4, 3*2, 2*(k-6), 1*3. Discret. Math. 308(23): 5871-5877 (2008) - 2007
- [j6]Wenjie He, Yufa Shen, Guoping Zheng:
Improved upper bounds for nearly antipodal chromatic number of paths. Discuss. Math. Graph Theory 27(1): 159-174 (2007) - 2006
- [j5]Wenjie He, Yufa Shen, Yongqiang Zhao, Yanning Wang, Xinmiao Ma:
On property M(3) of some complete multipartite graphs. Australas. J Comb. 35: 211-220 (2006) - [j4]Wenjie He, Yufa Shen, Yongqiang Zhao:
The use of Euler's formula in (3, 1)*-list-coloring. Discuss. Math. Graph Theory 26(1): 91-101 (2006) - 2005
- [c1]Yongqiang Zhao, Wenjie He, Yufa Shen, Yanning Wang:
Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs. CJCDGCGT 2005: 278-287 - 2004
- [j3]Wenjie He, Lixin Wang, Honghai Mi, Yufa Shen, Xinkai Yu:
Integral Sum Graphs from a Class of Trees. Ars Comb. 70 (2004) - 2002
- [j2]Wenjie He, Xinkai Yu, Honghai Mi, Yong Xu, Yufa Shen, Lixin Wang:
The (integral) sum number of Kn?E(Kr). Discret. Math. 243(1-3): 241-252 (2002) - 2001
- [j1]Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu:
The integral sum number of complete bipartite graphs Kr, s. Discret. Math. 239(1-3): 137-146 (2001)
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 2025-01-21 00:18 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:
