{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:55Z","timestamp":1759063855328},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T00:00:00Z","timestamp":1354147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00373-012-1267-7","type":"journal-article","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T14:07:32Z","timestamp":1354198052000},"page":"275-285","source":"Crossref","is-referenced-by-count":23,"title":["Rainbow Connection Number and Radius"],"prefix":"10.1007","volume":"30","author":[{"given":"Manu","family":"Basavaraju","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Sunil","family":"Chandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Rajendraprasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arunselvan","family":"Ramaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,29]]},"reference":[{"key":"1267_CR1","doi-asserted-by":"crossref","unstructured":"Caro, Y., Lev, A., Roditty, Y., Tuza, Z., Yuster, R.: On rainbow connection. Electron. J. Comb. 15(1), Research paper 57, 13 (2008)","DOI":"10.37236\/781"},{"key":"1267_CR2","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connection. J. Comb. Optim. 1\u201318 (2009)","DOI":"10.1007\/s10878-009-9250-9"},{"key":"1267_CR3","first-page":"330","volume":"21","author":"L.S. Chandran","year":"2011","unstructured":"Chandran L.S., Das A., Rajendraprasad D., Varma N.M.: Rainbow connection number and connected dominating sets. J. Graph Theory 21, 330\u2013347 (2011)","journal-title":"J. Graph Theory"},{"issue":"1","key":"1267_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"G. Chartrand","year":"2008","unstructured":"Chartrand G., Johns G.L., McKeon K.A., Zhang P.: Rainbow connection in graphs. Math. Bohem 133(1), 85\u201398 (2008)","journal-title":"Math. Bohem"},{"key":"1267_CR5","doi-asserted-by":"crossref","DOI":"10.1201\/9781584888017","volume-title":"Chromatic graph theory","author":"G. Chartrand","year":"2008","unstructured":"Chartrand G., Zhang P.: Chromatic graph theory. Chapman & Hall, London (2008)"},{"key":"1267_CR6","unstructured":"Dong, J., Li, X.: Rainbow connection number, bridges and radius. Preprint arXiv:1105.0790v1 [math.CO] (2011)"},{"issue":"3","key":"1267_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"M. Krivelevich","year":"2010","unstructured":"Krivelevich M., Yuster R.: The rainbow connection of a graph is at most reciprocal to its minimum degree. J. Graph Theory 63(3), 185\u2013191 (2010)","journal-title":"J. Graph Theory"},{"issue":"1","key":"1267_CR8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.37236\/1172","volume":"19","author":"X. Li","year":"2012","unstructured":"Li X., Liu S., Chandran L.S., Mathew R., Rajendraprasad D.: Rainbow connection number and connectivity. Electron. J. Comb. 19(1), 20 (2012)","journal-title":"Electron. J. Comb."},{"key":"1267_CR9","doi-asserted-by":"crossref","unstructured":"Li, X., Shi Y.: Rainbow connection in 3-connected graphs. Graphs Comb. 1\u20135 (2012). doi: 10.1007\/s00373-012-1204-9","DOI":"10.1007\/s00373-012-1204-9"},{"issue":"6","key":"1267_CR10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","volume":"2","author":"R.E. Tarjan","year":"1974","unstructured":"Tarjan R.E.: A note on finding the bridges of a graph. Inf. Process. Lett. 2(6), 160\u2013161 (1974)","journal-title":"Inf. Process. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1267-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1267-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1267-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T04:57:34Z","timestamp":1714625854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1267-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,29]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["1267"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1267-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,29]]}}}