{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T19:52:11Z","timestamp":1770061931513,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T00:00:00Z","timestamp":1467590400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0052-6","type":"journal-article","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T07:39:11Z","timestamp":1467617951000},"page":"182-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Rainbow connection numbers of Cayley graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Yingbin","family":"Ma","sequence":"first","affiliation":[]},{"given":"Zaiping","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,4]]},"reference":[{"key":"52_CR1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers SB, Krishnamurthy B (1989) A group-theoretic model for symmetric interconnection networks. IEEE Trans Comput 38:555\u2013566","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"52_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 LS, Rajendraprasad D, Ramaswamy A (2014) Rainbow connection number and radius. Graphs Combin 30(2):275\u2013285","journal-title":"Graphs Combin"},{"key":"52_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, Berlin"},{"key":"52_CR4","unstructured":"Cai QQ, Ma YB, Song JL. Rainbow connection numbers of ladders and M\u00f6bius ladders. Ars Combin (to appear)"},{"key":"52_CR5","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:R57","journal-title":"Electron J Combin"},{"key":"52_CR6","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 (2011) Hardness and algorithms for rainbow connection. J Comb Optim 21:330\u2013347","journal-title":"J Comb Optim"},{"key":"52_CR7","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/jgt.20643","volume":"71","author":"LS Chandran","year":"2012","unstructured":"Chandran LS, Das A, Rajendraprasad D, Varma NM (2012) Rainbow connection number and connected dominating sets. J Graph Theory 71:206\u2013218","journal-title":"J Graph Theory"},{"key":"52_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"G Chartrand","year":"2008","unstructured":"Chartrand G, Johns GL, McKeon KA, Zhang P (2008) Rainbow connection in graphs. Math Bohem 133:85\u201398","journal-title":"Math Bohem"},{"key":"52_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic graph theory","author":"C Godsil","year":"2001","unstructured":"Godsil C, Royle G (2001) Algebraic graph theory. Springer, New York"},{"key":"52_CR10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"M Krivelevich","year":"2009","unstructured":"Krivelevich M, Yuster R (2009) The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J Graph Theory 63:185\u2013191","journal-title":"J Graph Theory"},{"key":"52_CR11","doi-asserted-by":"crossref","first-page":"4082","DOI":"10.1016\/j.camwa.2011.09.056","volume":"62","author":"HZ Li","year":"2011","unstructured":"Li HZ, Li XL, Liu SJ (2011) The (strong) rainbow connection numbers of Cayley graphs on Abelian groups. Comput Math Appl 62:4082\u20134088","journal-title":"Comput Math Appl"},{"key":"52_CR12","first-page":"R20","volume":"19","author":"XL Li","year":"2012","unstructured":"Li XL, Liu SJ, Chandran LS, Mathew R, Rajendraprasad D (2012) Rainbow connection number and connectivity. Electron J Combin 19:R20","journal-title":"Electron J Combin"},{"key":"52_CR13","volume-title":"Rainbow connections of graphs","author":"XL Li","year":"2012","unstructured":"Li XL, Sun YF (2012) Rainbow connections of graphs. Springer, New York"},{"key":"52_CR14","unstructured":"Liang YJ (2012) Rainbow connection numbers of Cartesian product of graphs. 2012 Workshop on Graph Theory and Combinatorics and 2012 Symposium for Young Combiantorialists, August, pp. 10\u201312"},{"key":"52_CR15","first-page":"432","volume-title":"Rainbow connection in graphs with minimum degree three, IWOCA 2009. LNCS","author":"I Schiermeyer","year":"2009","unstructured":"Schiermeyer I (2009) Rainbow connection in graphs with minimum degree three, IWOCA 2009. LNCS, vol 5874. Springer, Berlin, pp 432\u2013437"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0052-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0052-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0052-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0052-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T01:59:54Z","timestamp":1718675994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0052-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,4]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["52"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0052-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,4]]}}}