Yang Yuansheng
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j60 | Guoqing Wang, Haoli Wang, Yuansheng Yang, Xuezhi Yang, Wenping Zheng: An upper bound for the crossing number of augmented cubes. Int. J. Comput. Math. 90(2): 183-227 (2013) | |
| 2012 | ||
| j59 | Yang Yuansheng, Xueliang Fu, Baoqi Jiang: On the Packing Number of Generalized Petersen Graphs P(n, 2). Ars Comb. 104: 23-32 (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) | |
| j57 | Zhao Chengye, Yang Yuansheng, Sun Linlin: Hamiltonian Properties of the 3-(γ, 2)-Critical Graphs. Ars Comb. 107: 177-192 (2012) | |
| c7 | Hong Yu, Xianchao Zhang, Yuansheng Yang, Xiaowei Zhao, Lei Cai: An Extended ISOMAP by Enhancing Similarity for Clustering. IEA/AIE 2012: 808-815 | |
| i5 | Baigong Zheng, Yuansheng Yang, Xirong Xu: An upper bound for the crossing number of bubble-sort graph Bn. CoRR abs/1211.4433 (2012) | |
| i4 | Yuansheng Yang, Baigong Zheng, Xiaohui Lin, Xirong Xu: The crossing numbers of $K_{n,n}-nK_2$, $K_{n}\times P_2$, $K_{n}\times P_3$ and $K_n\times C_4$. CoRR abs/1211.4437 (2012) | |
| i3 | Yuansheng Yang, Baigong Zheng, Xirong Xu: The crossing number of the generalized Petersen graph P(10, 3) is six. CoRR abs/1211.4438 (2012) | |
| i2 | Yuansheng Yang, Baigong Zheng, Xirong Xu, Xiaohui Lin: The crossing numbers of $K_m\times P_n$ and $K_m\times C_n$. CoRR abs/1211.4641 (2012) | |
| i1 | Yuansheng Yang, Bo Lv, Baigong Zheng, Xirong Xu, Ke Zhang: The crossing number of pancake graph $P_4$ is six. CoRR abs/1211.4642 (2012) | |
| 2011 | ||
| j56 | ||
| 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) | |
| j54 | Zhao Chengye, Yang Yuansheng, Sun Linlin, Feilong Cao: The Connected Domination and Tree Domination of P(n, k) for k = 1, 2, [n/2]. Ars Comb. 101: 467-479 (2011) | |
| j53 | Xueliang Fu, Yuansheng Yang, Baoqi Jiang: On the Domination Number of the Circulant Graphs C(n;{1, 2}), C(n;{1, 3}) and C(n;{1, 4}). Ars Comb. 102: 173-182 (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) | |
| j51 | Huiwei Zhou, Xiaoyan Li, Degen Huang, Yuansheng Yang, Fuji Ren: Voting-Based Ensemble Classifiers to Detect Hedges and Their Scopes in Biomedical Texts. IEICE Transactions 94-D(10): 1989-1997 (2011) | |
| j50 | Han Li, He Guo, Feng Chen, Hongji Yang, Yuansheng Yang: Using ontology to generate test cases for GUI testing. IJCAT 42(2/3): 213-224 (2011) | |
| j49 | Han Li, Hongji Yang, Feng Chen, He Guo, Yuansheng Yang: Feasibility study of software reengineering towards role-based access control. IJCAT 42(2/3): 239-251 (2011) | |
| j48 | Haoli Wang, Xirong Xu, Yuansheng Yang, Baosheng Zhang, Meiqin Luo, Guoqing Wang: Radio number of ladder graphs. Int. J. Comput. Math. 88(10): 2026-2034 (2011) | |
| j47 | Xirong Xu, Wenhua Zhai, Jun-Ming Xu, Aihua Deng, Yuansheng Yang: Fault-tolerant edge-pancyclicity of locally twisted cubes. Inf. Sci. 181(11): 2268-2277 (2011) | |
| j46 | Haoli Wang, Xirong Xu, Yuansheng Yang, Kai Lü: On the distance paired domination of generalized Petersen graphs P(n, 1) and P(n, 2). J. Comb. Optim. 21(4): 481-496 (2011) | |
| c6 | Huiwei Zhou, Xiaoyan Li, Degen Huang, Yuansheng Yang, Jianjun Ma: Detecting hedges scope based on phrase structures and dependency structures. NLPKE 2011: 415-420 | |
| 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) | |
| 2009 | ||
| j44 | Xirong Xu, Yang Yuansheng, Lizhong Han, Li Huijun: The Graphs C(t)13 are Graceful for t = 0, 3 (mod 4). Ars Comb. 90 (2009) | |
| j43 | Zhao Chengye, Yang Yuansheng, Shi Lei, Sun Linlin: The Connected and Tree Domination Number of P(n, k) for k = 4, 6, 8. Ars Comb. 92 (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. Discrete Applied Mathematics 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. Discrete Applied Mathematics 157(5): 1016-1023 (2009) | |
| j38 | Chunling Tong, Xiaohui Lin, Yuansheng Yang, Meiqin Luo: 2-rainbow domination of generalized Petersen graphs P(n, 2). Discrete Applied Mathematics 157(8): 1932-1937 (2009) | |
| j37 | Xueliang Fu, Yuansheng Yang, Baoqi Jiang: Roman domination in regular graphs. Discrete Mathematics 309(6): 1528-1537 (2009) | |
| j36 | Xueliang Fu, Yuansheng Yang, Baoqi Jiang: On the domination number of generalized Petersen graphs P(n, 2). Discrete Mathematics 309(8): 2445-2451 (2009) | |
| c5 | Han Li, Feng Chen, Hongji Yang, He Guo, William Cheng-Chung Chu, Yuansheng Yang: An Ontology-Based Approach for GUI Testing. COMPSAC (1) 2009: 632-633 | |
| c4 | Yuxin Wang, Liye Yuan, He Guo, Xinzhong Hui, Yuansheng Yang: An Effective Approach for Multicast on Multi-core Architecture. ScalCom-EmbeddedCom 2009: 37-41 | |
| 2008 | ||
| j35 | Xirong Xi, Yuansheng Yang, Yue Xi, Huijun Li: On (a, d)-Antimagic Labelings of Generalized Petersen Graphs P(n, 3). Ars Comb. 86 (2008) | |
| j34 | Xi Yue, Yang Yuansheng, Wang Liping: One edge union of k shell graphs is cordial. Ars Comb. 86 (2008) | |
| j33 | Xi Yue, Yang Yuansheng, Mominul, Wang Liping: Super Vertex-magic Total Labelings of W3, n. Ars Comb. 86 (2008) | |
| j32 | Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Xiwu Yang: The crossing number of flower snarks and related graphs. Ars Comb. 86 (2008) | |
| j31 | Xirong Xu, Yang Yuansheng, Li Huijun, Xi Yue: The Graphs C(t)11 are Graceful for t = 0, 1 (mod 4). Ars Comb. 88 (2008) | |
| j30 | Yongqi Sun, Yuansheng Yang, Zhihai Wang: The planar Ramsey numbers PR(K4-e, Kk-e). Ars Comb. 88 (2008) | |
| j29 | Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Chengrui Deng: On the crossing numbers of Kmsquare Cn and Km, lsquare Pn. Discrete Applied Mathematics 156(10): 1892-1907 (2008) | |
| j28 | Xueliang Fu, Yuansheng Yang, Baoqi Jiang: A note on the signed edge domination number in graphs. Discrete Applied Mathematics 156(14): 2790-2792 (2008) | |
| j27 | Zhao Chengye, Yang Yuansheng, Sun Linlin: Domination dot-critical graphs with no critical vertices. Discrete Mathematics 308(15): 3241-3248 (2008) | |
| j26 | Yongqi Sun, Yang Yuansheng, Lin Xiaohui, Song Yanan: The planar Ramsey number I. Discrete Mathematics 308(23): 5841-5848 (2008) | |
| j25 | Wenping Zheng, Xiaohui Lin, Yuansheng Yang: The crossing number of K2, mPn. Discrete Mathematics 308(24): 6639-6644 (2008) | |
| c3 | Hong Yu, Xiaoliang Yang, Xianchao Zhang, Yuansheng Yang: An Improved Random Walk Algorithm Based on Correlation Coefficient to Find Scientific Communities. CSSE (1) 2008: 690-693 | |
| 2007 | ||
| j24 | Xueliang Fu, Yuansheng Yang, Baoqi Jiang: On the Domination Number of Generalized Petersen Graphs P(n, 3). Ars Comb. 84 (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) | |
| j21 | Xirong Xu, Yang Yuansheng, Xi Yue, Khandoker Mohammed Mominul Haque, Shen Lixin: Super Edge-Magic Labelings of Generalized Petersen Graphs P(n, 3). Ars Comb. 85 (2007) | |
| j20 | Yang Yuansheng, Xirong Xu, Xi Yue, Li Huijun: The Graphs C(t)9 are Graceful for t = 0, 3 (mod 4). Ars Comb. 85 (2007) | |
| j19 | Yongqi Sun, Yang Yuansheng, Lin Xiaohui, Qiao Jing: The planar Ramsey number PR(K4-e, K5). Discrete Mathematics 307(1): 137-142 (2007) | |
| j18 | Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Chong Cui: On the Crossing Number of K m P n . Graphs and Combinatorics 23(3): 327-336 (2007) | |
| 2006 | ||
| j17 | Yang Yuansheng, Xirong Xu, Xi Yue, Li Huijun, Khandoker Mohammed Mominul Haque: The Graphs C(t)7 are Graceful for t = 0, 1, (mod 4). Ars Comb. 79 (2006) | |
| j16 | Yang Yuansheng, Lin Xiaohui, Qiao Jing: The face pair of planar graphs. Discrete Mathematics 306(15): 1742-1757 (2006) | |
| j15 | Yongqi Sun, Yang Yuansheng, Xu Feng, Li Bingxi: New Lower Bounds on the Multicolor Ramsey Numbers Rr(C2m). Graphs and Combinatorics 22(2): 283-288 (2006) | |
| 2005 | ||
| j14 | Yang Yuansheng, Lin Xiaohui, Chunyan Yu: The Graphs C(t)5 are Graceful for t = 0, 3 (mod 4). Ars Comb. 74 (2005) | |
| j13 | Yang Yuansheng, Xirong Xu, Xi Yue, Qiao Jing: On Harmonious Labelings of the Balanced Quadruple Shells. Ars Comb. 75 (2005) | |
| j12 | Xiaohui Lin, Yuansheng Yang, Jianguo Lü, Xin Hao: The Crossing Number of C(mk;{1, k}). Graphs and Combinatorics 21(1): 89-96 (2005) | |
| j11 | Yang Yuansheng, Zhao Chengye, Lin Xiaohui, Jiang Yongsong, Hao Xin: Some 3-connected 4-edge-critical non-Hamiltonian graphs. Journal of Graph Theory 50(4): 316-320 (2005) | |
| 2004 | ||
| j10 | Yang Yuansheng, Lin Xiaohui, Lu Jianguo, Hao Xin: The crossing number of C(n; 1, 3 ). Discrete Mathematics 289(1-3): 107-118 (2004) | |
| c2 | Weifa Liang, Yang Yuansheng: Maximizing Battery Life Routing in Wireless Ad Hoc Networks. HICSS 2004 | |
| c1 | Lishuang Li, Chunrong Chen, Degen Huang, Yuansheng Yang: Identifying Pronunciation-Translated Names from Chinese Texts Based on Support Vector Machines. ISNN (1) 2004: 983-987 | |
| 2003 | ||
| j9 | Yang Yuansheng, Weifa Liang: The minimum number of vertices with girth 6 and degree set D={r, m}. Discrete Mathematics 269(1-3): 249-258 (2003) | |
| j8 | Yuansheng Yang, Xiaohui Lin, Zhiqiang Chen, Weiming Lu: 4-regular graphs without cut-vertices having the same path layer matrix. Journal of Graph Theory 44(4): 304-311 (2003) | |
| 2002 | ||
| j7 | Yuansheng Yang, Jianhua Lin, Chunli Wang: Three forbidden subgraphs for line graphs. Discrete Mathematics 252(1-3): 287-292 (2002) | |
| j6 | Yuansheng Yang, Jianhua Lin, Chunli Wang: Small regular graphs having the same path layer matrix. Journal of Graph Theory 39(4): 219-221 (2002) | |
| 2000 | ||
| j5 | Yuansheng Yang, Jianhua Lin, Chunli Wang, Kaifeng Li: On Kotzig's conjecture concerning graphs with a unique regular path-connectivity. Discrete Mathematics 211: 287-298 (2000) | |
| 1997 | ||
| j4 | Lin Xiaohui, Jiang Wenzhou, Chengxue Zhang, Yang Yuansheng: 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. Discrete Mathematics 175(1-3): 277-282 (1997) | |
| 1995 | ||
| j2 | Yang Yuansheng, G. R. T. Hendry: The ramsey number r(k1 + c4, k5 - e). Journal of Graph Theory 19(1): 13-15 (1995) | |
| 1994 | ||
| j1 | Yuansheng Yang, Peter Rowlinson: The third Ramsey numbers for graphs with at most four edges. Discrete Mathematics 125(1-3): 399-406 (1994) | |
Colors in the list of coauthors
Last update Sat May 25 22:45:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page