{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:39Z","timestamp":1740107139998,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T00:00:00Z","timestamp":1495411200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11371205, 11531011"],"award-info":[{"award-number":["11371205, 11531011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00373-017-1783-6","type":"journal-article","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T05:19:02Z","timestamp":1495430342000},"page":"999-1008","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["3-Rainbow Index and Forbidden Subgraphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Wenjing","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingshu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,22]]},"reference":[{"key":"1783_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan Press, London (1976)"},{"issue":"9","key":"1783_CR2","doi-asserted-by":"crossref","first-page":"2304","DOI":"10.1016\/j.disc.2016.02.015","volume":"339","author":"J Brousek","year":"2016","unstructured":"Brousek, J., Holub, P., Ryj\u00e1\u010dek, Z., Vr\u00e1na, P.: Finite families of forbidden subgraphs for rainbow connection in graphs. Discrete Math. 339(9), 2304\u20132312 (2016)","journal-title":"Discrete Math."},{"key":"1783_CR3","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1007\/s10878-014-9815-0","volume":"31","author":"Q Cai","year":"2016","unstructured":"Cai, Q., Li, X., Zhao, Y.: The 3-rainbow index and connected dominating sets. J. Combin. Optim. 31, 1142\u20131159 (2016)","journal-title":"J. Combin. Optim."},{"issue":"1","key":"1783_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":"1783_CR5","first-page":"360","volume":"55","author":"G Chartrand","year":"2010","unstructured":"Chartrand, G., Okamoto, F., Zhang, P.: Rainbow trees in graphs and generalized conncectivity. Networks 55, 360\u2013367 (2010)","journal-title":"Networks"},{"issue":"1","key":"1783_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.7151\/dmgt.1780","volume":"35","author":"L Chen","year":"2015","unstructured":"Chen, L., Li, X., Yang, K., Zhao, Y.: The 3-rainbow index of a graph. Discuss. Math. Graph Theory 35(1), 81\u201394 (2015)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"10","key":"1783_CR7","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1016\/j.disc.2014.08.008","volume":"338","author":"P Holub","year":"2015","unstructured":"Holub, P., Ryj\u00e1\u010dek, Z., Schiermeyer, I., Vr\u00e1na, P.: Rainbow connection and foridden subgraphs. Discrete Math. 338(10), 1706\u20131713 (2015)","journal-title":"Discrete Math."},{"key":"1783_CR8","doi-asserted-by":"crossref","unstructured":"Li, W., Li, X., Zhang, J.: Rainbow vertex-connection and forbidden subgraphs. Discuss. Math. Graph Theory (2017) (accepted)","DOI":"10.7151\/dmgt.2004"},{"key":"1783_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-012-1243-2","volume":"29","author":"X Li","year":"2013","unstructured":"Li, X., Shi, Y., Sun, Y.: Rainbow connections of graphs: a survey. Graphs Combin. 29, 1\u201338 (2013)","journal-title":"Graphs Combin."},{"key":"1783_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow Connections of Graphs. Springer Briefs in Math","author":"X Li","year":"2012","unstructured":"Li, X., Sun, Y.: Rainbow Connections of Graphs. Springer Briefs in Math. Springer, New York (2012)"},{"key":"1783_CR11","first-page":"264","volume":"30","author":"FP Ramsey","year":"1920","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 30, 264\u2013286 (1920)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1783-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1783-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1783-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T05:33:14Z","timestamp":1602135194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1783-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,22]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1783"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1783-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,5,22]]}}}