Остановите войну!
for scientists:
default search action
Yuansheng Yang
- > Home > Persons > Yuansheng Yang
Publications
- 2015
- [c12]Xiaomei Wang, Xiaohui Lin, Xin Huang, Yuansheng Yang:
Ensemble unsupervised feature selection based on permutation and R-value. FSKD 2015: 795-800 - 2013
- [j64]Kh. Md. Mominul Haque, Xiaohui Lin, Yuansheng Yang, Pingzhong Zhao:
Prime labeling on Knödel graphs W3, n. Ars Comb. 109: 113-128 (2013) - [j63]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhengwei Hou:
L(2, 1)-labeling of flower snark and related graphs. Ars Comb. 110: 505-512 (2013) - 2012
- [j58]Kh. Md. Mominul Haque, Xiaohui Lin, Yuansheng Yang, Jinbo Zhang:
Prime Cordial labeling of Flower Snark and related graphs. Ars Comb. 105: 45-52 (2012) - [i4]Yuansheng Yang, Baigong Zheng, Xiaohui Lin, Xirong Xu:
The crossing numbers of Kn,n - nK2, Kn × P2, Kn × P3 and Kn × C4. CoRR abs/1211.4437 (2012) - [i2]Yuansheng Yang, Baigong Zheng, Xirong Xu, Xiaohui Lin:
The crossing numbers of Km × Pn and Km × Cn. CoRR abs/1211.4641 (2012) - 2011
- [j55]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Xiwu Yang:
The Crossing Numbers of Cartesian Product of Cone Graph Cm + Kl with Path Pn. Ars Comb. 98: 433-335 (2011) - [j52]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Baosheng Zhang, Xianchen Zheng:
A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n, 3). Ars Comb. 102: 483-492 (2011) - 2010
- [j45]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhengwei Hou:
(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks. Ars Comb. 96 (2010) - [c7]Yuansheng Yang, Haiyan Li, Xiaohui Lin, Di Ming:
Recursive Feature Selection Based on Minimum Redundancy Maximum Relevancy. PAAP 2010: 281-285 - 2009
- [j42]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Gui Yang:
On the Crossing Numbers of the k-th Power of Pn. Ars Comb. 92 (2009) - [j41]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhengwei Hou:
(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks. Ars Comb. 93 (2009) - [j40]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhihe Li:
Equitable total coloring of CmCn. Discret. Appl. Math. 157(4): 596-601 (2009) - [j39]Xiaohui Lin, Yuansheng Yang, Wenping Zheng, Lei Shi, Weiming Lu:
The crossing numbers of generalized Petersen graphs with small order. Discret. Appl. Math. 157(5): 1016-1023 (2009) - [j38]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Meiqin Luo:
2-rainbow domination of generalized Petersen graphs P(n, 2). Discret. Appl. Math. 157(8): 1932-1937 (2009) - 2008
- [j32]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Xiwu Yang:
The crossing number of flower snarks and related graphs. Ars Comb. 86 (2008) - [j29]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Chengrui Deng:
On the crossing numbers of Kmsquare Cn and Km, lsquare Pn. Discret. Appl. Math. 156(10): 1892-1907 (2008) - [j26]Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Yanan Song:
The planar Ramsey number I. Discret. Math. 308(23): 5841-5848 (2008) - [j25]Wenping Zheng, Xiaohui Lin, Yuansheng Yang:
The crossing number of K2, mPn. Discret. Math. 308(24): 6639-6644 (2008) - 2007
- [j23]Yongqi Sun, Yuansheng Yang, Baoqi Jiang, Xiaohui Lin, Lei Shi:
On Multicolor Ramsey Numbers for Even Cycles in Graphs. Ars Comb. 84 (2007) - [j22]Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Wenping Zheng:
On the Three Color Ramsey Numbers R(Cm, C4, C4). Ars Comb. 84 (2007) - [j19]Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Qiao Jing:
The planar Ramsey number PR(K4-e, K5). Discret. Math. 307(1): 137-142 (2007) - [j18]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Chong Cui:
On the Crossing Number of K m P n . Graphs Comb. 23(3): 327-336 (2007) - 2006
- [j16]Yuansheng Yang, Xiaohui Lin, Qiao Jing:
The face pair of planar graphs. Discret. Math. 306(15): 1742-1757 (2006) - 2005
- [j14]Yuansheng Yang, Xiaohui Lin, Chunyan Yu:
The Graphs C(t)5 are Graceful for t = 0, 3 (mod 4). Ars Comb. 74 (2005) - [j12]Xiaohui Lin, Yuansheng Yang, Jianguo Lü, Xin Hao:
The Crossing Number of C(mk;{1, k}). Graphs Comb. 21(1): 89-96 (2005) - [j11]Yuansheng Yang, Chengye Zhao, Xiaohui Lin, Yongsong Jiang, Xin Hao:
Some 3-connected 4-edge-critical non-Hamiltonian graphs. J. Graph Theory 50(4): 316-320 (2005) - 2004
- [j10]Yuansheng Yang, Xiaohui Lin, Jianguo Lu, Xin Hao:
The crossing number of C(n; 1, 3 ). Discret. Math. 289(1-3): 107-118 (2004) - 2003
- [j8]Yuansheng Yang, Xiaohui Lin, Zhiqiang Chen, Weiming Lu:
4-regular graphs without cut-vertices having the same path layer matrix. J. Graph Theory 44(4): 304-311 (2003) - 1997
- [j4]Xiaohui Lin, Wenzhou Jiang, Chengxue Zhang, Yuansheng Yang:
On Smallest Maximally Nonhamiltonian Graphs. Ars Comb. 45 (1997) - [j3]Xiaohui Lin, Minghua Zhu, Zhengguo Yu, Chengxue Zhang, Yuansheng Yang:
On distinct distance sets in a graph. Discret. Math. 175(1-3): 277-282 (1997)
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:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint