{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T21:38:50Z","timestamp":1777066730810,"version":"3.51.4"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T00:00:00Z","timestamp":1341360000000},"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":[[2013,9]]},"DOI":"10.1007\/s00373-012-1204-9","type":"journal-article","created":{"date-parts":[[2012,7,3]],"date-time":"2012-07-03T16:16:14Z","timestamp":1341332174000},"page":"1471-1475","source":"Crossref","is-referenced-by-count":28,"title":["Rainbow Connection in 3-Connected Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,4]]},"reference":[{"key":"1204_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, GTM 244. Springer, Berlin (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"1204_CR2","doi-asserted-by":"crossref","first-page":"R57","DOI":"10.37236\/781","volume":"15","author":"Y. Caro","year":"2008","unstructured":"Caro Y., Lev A., Roditty Y., Tuza Z., Yuster R.: On rainbow connection. Electron J. Combin. 15, R57 (2008)","journal-title":"Electron J. Combin."},{"key":"1204_CR3","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/s10878-009-9250-9","volume":"21","author":"S. Chakraborty","year":"2011","unstructured":"Chakraborty S., Fischer E., Matsliah A., Yuster R.: Hardness and algorithms for rainbow connectivity. J. Comb. Optim 21, 330\u2013347 (2011)","journal-title":"J. Comb. Optim"},{"key":"1204_CR4","unstructured":"Chandran, L.S., Das, A., Rajendraprasad D., Varma, N.M.: Rainbow connection number and connected dominating sets. J. Graph Theory. doi: 10.1002\/jgt20643"},{"key":"1204_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"1","author":"G. Chartrand","year":"2008","unstructured":"Chartrand G., Johns G.L., McKeon K.A., Zhang P.: Rainbow connection in graphs. Math. Bohemica 1, 85\u201398 (2008)","journal-title":"Math. Bohemica"},{"issue":"3","key":"1204_CR6","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"},{"key":"1204_CR7","doi-asserted-by":"crossref","unstructured":"Li, X., Sun, Y.: Rainbow connections of graphs. In: Springer Briefs in Mathematics. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-3119-0"},{"key":"1204_CR8","doi-asserted-by":"crossref","unstructured":"Schiermeyer, I.: Rainbow connection in graphs with minimum degree three. In: IWOCA 2009, LNCS, vol. 5874, pp. 432\u2013437 (2009)","DOI":"10.1007\/978-3-642-10217-2_42"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1204-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1204-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1204-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T10:16:36Z","timestamp":1714126596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1204-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,4]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1204"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1204-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,4]]}}}