Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou. On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. In Bin Fu, Ding-Zhu Du, editors, Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings. Volume 6842 of Lecture Notes in Computer Science, pages 86-97, Springer, 2011. [doi]
@inproceedings{UchizawaAISZ11,
title = {On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms},
author = {Kei Uchizawa and Takanori Aoki and Takehiro Ito and Akira Suzuki and Xiao Zhou},
year = {2011},
doi = {10.1007/978-3-642-22685-4_8},
url = {http://dx.doi.org/10.1007/978-3-642-22685-4_8},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/UchizawaAISZ11},
cites = {0},
citedby = {0},
pages = {86-97},
booktitle = {Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
editor = {Bin Fu and Ding-Zhu Du},
volume = {6842},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-22684-7},
}