Author:
Li Shasha,Li Xueliang,Shi Yongtang
Funder
National Science Foundation of China
Natural Science Foundation of Ningbo, China
PCSIRT
China Postdoctoral Science Foundation
China Scholarship Council
Subject
Applied Mathematics,Computational Mathematics
Reference10 articles.
1. P. Ananth, M. Nasre, New hardness results in rainbow connectivity, arXiv:1104.2074v1 [cs.CC], 2011.
2. Graph Theory, GTM 244;Bondy,2008
3. On rainbow connection;Caro;Electron. J. Comb.,2008
4. S. Chakraborty, E. Fischer, A. Matsliah, R. Yuster, Hardness and algorithms for rainbow connectivity, in: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, 2009, pp. 243–254. Also, see J. Comb. Optim. 21(2011), 330–347.
5. Rainbow connection in graphs;Chartrand;Math. Bohem.,2008
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献