Author:
Huang Xiaolong,Li Xueliang,Shi Yongtang,Yue Jun,Zhao Yan
Funder
NSFC
PCSIRT
China Postdoctoral Science Foundation
China Scholarship Council
Subject
Applied Mathematics,Computational Mathematics
Reference23 articles.
1. On rainbow connection;Caro;Electron J. Comb.,2008
2. 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).
3. Rainbow connection number and connected dominating sets;Chandran;Electron. Notes Discrete Math.,2011
4. Rainbow connection in graphs;Chartrand;Math. Bohemica,2008
5. Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs;Deng;Appl. Math. Lett.,2012
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献