乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:37Z","timestamp":1740107137896,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,4,12]],"date-time":"2016-04-12T00:00:00Z","timestamp":1460419200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11371205, 11531011","11461030"],"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":[[2016,9]]},"DOI":"10.1007\/s00373-016-1704-0","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T10:36:14Z","timestamp":1460630174000},"page":"1829-1841","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Rainbow Connection Number and Independence Number of a Graph"],"prefix":"10.1007","volume":"32","author":[{"given":"Jiuying","family":"Dong","sequence":"first","affiliation":[]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,12]]},"reference":[{"key":"1704_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"key":"1704_CR2","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s00373-012-1267-7","volume":"30","author":"M Basavaraju","year":"2014","unstructured":"Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Ramaswamy, A.: Rainbow connection number and radius. Graphs Comb. 30, 275\u2013285 (2014)","journal-title":"Graphs Comb."},{"key":"1704_CR3","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, Zs, Yuster, R.: On rainbow connection. Electron. J. Comb. 15, R57 (2008)","journal-title":"Electron. J. Comb."},{"key":"1704_CR4","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 connection. J. Comb. Optim. 21, 330\u2013347 (2011)","journal-title":"J. Comb. Optim."},{"key":"1704_CR5","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/jgt.20643","volume":"71","author":"LS Chandran","year":"2012","unstructured":"Chandran, L.S., Das, A., Rajendraprasad, D., Varma, N.M.: Rainbow connection number and connected dominating sets. J. Graph Theory 71, 206\u2013218 (2012)","journal-title":"J. Graph Theory"},{"key":"1704_CR6","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, 85\u201398 (2008)","journal-title":"Math. Bohem."},{"issue":"1","key":"1704_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/jgt.20540","volume":"68","author":"G Chen","year":"2011","unstructured":"Chen, G., Hu, Z., Wu, Y.: Circumferences of $$k$$ k -connected graphs involving independence numbers. J. Graph Theory 68(1), 55\u201376 (2011)","journal-title":"J. Graph Theory"},{"issue":"4","key":"1704_CR8","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/s10255-013-0247-x","volume":"29","author":"J Dong","year":"2013","unstructured":"Dong, J., Li, X.: Upper bound involving parameter $$\\sigma _2$$ \u03c3 2 for the rainbow connection number. Acta Math. Appl. Sinica 29(4), 685\u2013688 (2013)","journal-title":"Acta Math. Appl. Sinica"},{"key":"1704_CR9","first-page":"7","volume":"43","author":"J Dong","year":"2013","unstructured":"Dong, J., Li, X.: Rainbow connection numbers and the minimum degree sum of a graph. Sci. China Math. 43, 7\u201314 (2013). (in Chinese)","journal-title":"Sci. China Math."},{"issue":"19","key":"1704_CR10","doi-asserted-by":"crossref","first-page":"1884","DOI":"10.1016\/j.disc.2012.04.022","volume":"313","author":"J Ekstein","year":"2013","unstructured":"Ekstein, J., Holub, P., Kaiser, T., Koch, M., Camacho, S., Ryjacek, Z., Schiermeyer, I.: The rainbow connection number of 2-connected graphs. Discrete Math. 313(19), 1884\u20131892 (2013)","journal-title":"Discrete Math."},{"key":"1704_CR11","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, 185\u2013191 (2010)","journal-title":"J. Graph Theory"},{"key":"1704_CR12","doi-asserted-by":"crossref","first-page":"P20","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, P20 (2012)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"1704_CR13","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 Comb. 29(1), 1\u201338 (2013)","journal-title":"Graphs Comb."},{"key":"1704_CR14","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)"},{"issue":"2","key":"1704_CR15","doi-asserted-by":"crossref","first-page":"387","DOI":"10.7151\/dmgt.1553","volume":"31","author":"I Schiermeyer","year":"2011","unstructured":"Schiermeyer, I.: Bounds for the rainbow connection number of graphs. Discuss. Math. Graph Theory 31(2), 387\u2013395 (2011)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1704_CR16","doi-asserted-by":"crossref","unstructured":"Schiermeyer, I.: Rainbow connection in graphs with minimum degree three. 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-016-1704-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1704-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1704-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T19:12:04Z","timestamp":1718478724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1704-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,12]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1704"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1704-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2016,4,12]]}}}