Cite
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.
MLA
Uchizawa, Kei, et al. “On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.” Algorithmica, vol. 67, no. 2, Oct. 2013, pp. 161–79. EBSCOhost, https://doi.org/10.1007/s00453-012-9689-4.
APA
Uchizawa, K., Aoki, T., Ito, T., Suzuki, A., & Zhou, X. (2013). On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. Algorithmica, 67(2), 161–179. https://doi.org/10.1007/s00453-012-9689-4
Chicago
Uchizawa, Kei, Takanori Aoki, Takehiro Ito, Akira Suzuki, and Xiao Zhou. 2013. “On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.” Algorithmica 67 (2): 161–79. doi:10.1007/s00453-012-9689-4.