{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:10Z","timestamp":1759063810834},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,28]],"date-time":"2013-02-28T00:00:00Z","timestamp":1362009600000},"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":[[2014,5]]},"DOI":"10.1007\/s00373-013-1295-y","type":"journal-article","created":{"date-parts":[[2013,2,27]],"date-time":"2013-02-27T06:44:25Z","timestamp":1361947465000},"page":"591-607","source":"Crossref","is-referenced-by-count":11,"title":["Rainbow Connection and Graph Products"],"prefix":"10.1007","volume":"30","author":[{"given":"Tanja","family":"Gologranc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ga\u0161per","family":"Meki\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iztok","family":"Peterin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,28]]},"reference":[{"key":"1295_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00373-011-1031-4","volume":"28","author":"B.S. Anand","year":"2012","unstructured":"Anand B.S., Changat M., Klav\u017ear S., Peterin I.: Convex sets in lexicographic products of graphs. Graphs Comb. 28, 77\u201384 (2012)","journal-title":"Graphs Comb."},{"key":"1295_CR2","first-page":"45","volume":"41","author":"B. Bre\u0161ar","year":"2008","unstructured":"Bre\u0161ar B., \u0160pacapan S.: On the connectivity of the direct product of graphs. Australas. J. Comb. 41, 45\u201356 (2008)","journal-title":"Australas. J. Comb."},{"key":"1295_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 Z., Yuster R.: On rainbow connection. Electron. J. Comb. 15, #R57 (2008)","journal-title":"Electron. J. Comb."},{"key":"1295_CR4","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/s10878-009-9250-9","volume":"3","author":"S. Chakraborty","year":"2011","unstructured":"Chakraborty S., Fischer E., Matsliah A., Yuster R.: Hardness and algorithms for rainbow connection. J. Comb. Optim. 3, 330\u2013347 (2011)","journal-title":"J. Comb. Optim."},{"key":"1295_CR5","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."},{"key":"1295_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/net.20296","volume":"54","author":"G. Chartrand","year":"2009","unstructured":"Chartrand G., Johns G.L., McKeon K.A., Zhang P.: The rainbow connectivity of a graph. Networks 54, 75\u201381 (2009)","journal-title":"Networks"},{"key":"1295_CR7","first-page":"633","volume":"10","author":"P. Erd\u0151s","year":"1975","unstructured":"Erd\u0151s P., Simonovits M., S\u00f3s V.T.: Anti-Ramsey theorems. Colloq. Math. Soc. J\u00e1nos Bolyai 10, 633\u2013643 (1975)","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"1295_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-010-0891-3","volume":"26","author":"S. Fujita","year":"2010","unstructured":"Fujita S., Magnant C., Ozeki K.: Rainbow generalization of Ramsey theory: a survey. Graphs Comb. 26, 1\u201330 (2010)","journal-title":"Graphs Comb."},{"key":"1295_CR9","first-page":"201","volume":"74","author":"A.A. Ghidewon","year":"2005","unstructured":"Ghidewon A.A., Hammack R.: Centers of tensor product of graphs. Ars Comb. 74, 201\u2013211 (2005)","journal-title":"Ars Comb."},{"key":"1295_CR10","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1016\/j.aml.2009.03.008","volume":"22","author":"R. Guji","year":"2009","unstructured":"Guji R., Vumar E.: A note on the connectivity of Kronecker products of graphs. Appl. Math. Lett. 22, 1360\u20131363 (2009)","journal-title":"Appl. Math. Lett."},{"key":"1295_CR11","doi-asserted-by":"crossref","unstructured":"Hammack, R.; Imrich, W.; Klav\u017ear, S.: Handbook of product graphs, 2nd edn. CRC Press, Boca Raton (2011)","DOI":"10.1201\/b10959"},{"key":"1295_CR12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.7151\/dmgt.1057","volume":"17","author":"P.K. Jha","year":"1997","unstructured":"Jha P.K., Klav\u017ear S., Zmazek B.: Isomorphic components of Kronecker product of bipartite graphs. Discuss. Math. Graph Theory 17, 301\u2013309 (1997)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1295_CR13","first-page":"193","volume":"81","author":"S.R. Kim","year":"1991","unstructured":"Kim S.R.: Centers of a tensor composite graph, Congr. Numer 81, 193\u2013203 (1991)","journal-title":"Numer"},{"key":"1295_CR14","doi-asserted-by":"crossref","first-page":"783","DOI":"10.7151\/dmgt.1644","volume":"32","author":"S. Klav\u017ear","year":"2012","unstructured":"Klav\u017ear S., Meki\u0161 G.: On the rainbow connection of Cartesian products and their subgraphs. Discuss. Math. Graph Theory 32, 783\u2013793 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1295_CR15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1142\/S1793557108000102","volume":"1","author":"S. Klav\u017ear","year":"2008","unstructured":"Klav\u017ear S., \u0160pacapan S.: On the edge-connectivity of Cartesian product graphs. Asian Eur. J. Math 1, 93\u201398 (2008)","journal-title":"Asian Eur. J. Math"},{"key":"1295_CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"M. Krivelevich","year":"2009","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 (2009)","journal-title":"J. Graph Theory"},{"key":"1295_CR17","unstructured":"Li, X., Sun, Y.: Characterize graphs with rainbow connection number m \u2212 2 and rainbow connection numbers of some graph operations, manuscript."},{"key":"1295_CR18","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 connection of graphs: a survey. Graphs Comb. 29, 1\u201338 (2013)","journal-title":"Graphs Comb."},{"key":"1295_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.20265","volume":"57","author":"R.J. Nowakowski","year":"2008","unstructured":"Nowakowski R.J., Seyffarth K.: Small cycle double covers of products. I. Lexicographic product with paths and cycles. J. Graph Theory 57, 99\u2013123 (2008)","journal-title":"J. Graph Theory"},{"key":"1295_CR20","doi-asserted-by":"crossref","unstructured":"Peterin, I.: Intervals and convex sets in strong product of graphs, Graphs Comb. doi: 10.1007\/s00373-012-1144-4","DOI":"10.1007\/s00373-012-1144-4"},{"key":"1295_CR21","first-page":"435","volume":"5874","author":"I. Schiermeyer","year":"2009","unstructured":"Schiermeyer I.: Rainbow connection in graphs with minimum degree three, IWOCA 2009. LNCS 5874, 435\u2013437 (2009)","journal-title":"LNCS"},{"key":"1295_CR22","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, 387\u2013395 (2011)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1295_CR23","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s00373-010-0919-8","volume":"26","author":"S. \u0160pacapan","year":"2010","unstructured":"\u0160pacapan S.: Connectivity of strong products of graphs. Graphs Comb. 26, 457\u2013467 (2010)","journal-title":"Graphs Comb."},{"key":"1295_CR24","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1090\/S0002-9939-1962-0133816-6","volume":"13","author":"P.M. Weichsel","year":"1962","unstructured":"Weichsel P.M.: The Kronecker product of graphs. Proc. Am. Math. Soc. 13, 47\u201352 (1962)","journal-title":"Proc. Am. Math. Soc."},{"key":"1295_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/jgt.20338","volume":"59","author":"X. Zhu","year":"2008","unstructured":"Zhu X.: Game coloring the Cartesian product of graphs. J. Graph Theory 59, 261\u2013278 (2008)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1295-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1295-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1295-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T14:35:02Z","timestamp":1715006102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1295-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,28]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["1295"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1295-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,28]]}}}