{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T01:54:10Z","timestamp":1725155650114},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,22]],"date-time":"2015-07-22T00:00:00Z","timestamp":1437523200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["NSFC No.11371205"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10878-015-9938-y","type":"journal-article","created":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T11:40:03Z","timestamp":1437478803000},"page":"123-131","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Erd\u0151s\u2013Gallai-type results for colorful monochromatic connectivity of a graph"],"prefix":"10.1007","volume":"33","author":[{"given":"Qingqiong","family":"Cai","sequence":"first","affiliation":[]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Di","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,22]]},"reference":[{"key":"9938_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory, GTM","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory, GTM. Springer, Berlin"},{"issue":"1","key":"9938_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 (2008) On rainbow connection. Electron J Combin 15(1):R57","journal-title":"Electron J Combin"},{"key":"9938_CR3","doi-asserted-by":"crossref","first-page":"1786","DOI":"10.1016\/j.disc.2011.04.020","volume":"311","author":"Y Caro","year":"2011","unstructured":"Caro Y, Yuster R (2011) Colorful monochromatic connectivity. Discret Math 311:1786\u20131792","journal-title":"Discret Math"},{"key":"9938_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, McKeon K, Zhang P (2008) Rainbow connection in graphs. Math Bohem 133:85\u201398","journal-title":"Math Bohem"},{"key":"9938_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.7151\/dmgt.1547","volume":"31","author":"A Kemnitz","year":"2011","unstructured":"Kemnitz A, Schiermeyer I (2011) Graphs with rainbow connection number two. Discuss Math Graph Theory 31:313\u2013320","journal-title":"Discuss Math Graph Theory"},{"issue":"3","key":"9938_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 (2010) The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J Graph Theory 63(3):185\u2013191","journal-title":"J Graph Theory"},{"issue":"4","key":"9938_CR7","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1007\/s00373-013-1309-9","volume":"30","author":"H Li","year":"2014","unstructured":"Li H, Li X, Sun Y, Zhao Y (2014) Note on minimally d-rainbow connected graphs. Graphs Combin 30(4):949\u2013955","journal-title":"Graphs Combin"},{"key":"9938_CR8","doi-asserted-by":"crossref","first-page":"603","DOI":"10.7151\/dmgt.1692","volume":"33","author":"X Li","year":"2013","unstructured":"Li X, Liu M, Schiermeyer I (2013) Rainbow connection number of dense graphs. Discuss Math Graph Theory 33:603\u2013611","journal-title":"Discuss Math Graph Theory"},{"key":"9938_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 (2013) Rainbow connections of graphs: a survey. Graphs Combin 29:1\u201338","journal-title":"Graphs Combin"},{"key":"9938_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow connections of graphs (Springer briefs in mathematics)","author":"X Li","year":"2012","unstructured":"Li X, Sun Y (2012) Rainbow connections of graphs (Springer briefs in mathematics). Springer, New York"},{"key":"9938_CR11","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.disc.2014.04.024","volume":"331","author":"A Lo","year":"2014","unstructured":"Lo A (2014) A note on the minimum size of k-rainbow-connected graphs. Discret Math 331:20\u201321","journal-title":"Discret Math"},{"key":"9938_CR12","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1016\/j.dam.2011.05.001","volume":"161","author":"I Schiermeyer","year":"2013","unstructured":"Schiermeyer I (2013) On minimally rainbow k-connected graphs. Discret Appl Math 161:702\u2013705","journal-title":"Discret Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9938-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9938-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9938-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9938-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T03:17:51Z","timestamp":1717989471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9938-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,22]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9938"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9938-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,22]]}}}