{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T05:06:04Z","timestamp":1777352764487,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T00:00:00Z","timestamp":1267488000000},"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":[[2010,5]]},"DOI":"10.1007\/s00373-010-0919-8","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T05:09:11Z","timestamp":1267420151000},"page":"457-467","source":"Crossref","is-referenced-by-count":28,"title":["Connectivity of Strong Products of Graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Simon","family":"\u0160pacapan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,2]]},"reference":[{"key":"919_CR1","doi-asserted-by":"crossref","first-page":"2444","DOI":"10.1016\/j.dam.2007.06.014","volume":"155","author":"C. Balbuena","year":"2007","unstructured":"Balbuena C., Cera M., Di\u00e1nez A., Garc\u00eda-V\u00e1zquez P., Marcote X.: On the edge-connectivity and restricted edge-connectivity of a product of graphs. Discrete Appl. Math. 155, 2444\u20132455 (2007)","journal-title":"Discrete Appl. Math."},{"key":"919_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.20056","volume":"45","author":"C. Balbuena","year":"2005","unstructured":"Balbuena C., Marcote X., Garc\u00eda-V\u00e1zquez P.: On restricted connectivities of permutation graphs. Networks 45, 113\u2013118 (2005)","journal-title":"Networks"},{"key":"919_CR3","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1090\/S0002-9939-04-07470-2","volume":"133","author":"T. Bohman","year":"2005","unstructured":"Bohman T.: A limit theorem for the Shannon capacities of odd cycles II. Proc. Amer. Math. Soc. 133, 537\u2013543 (2005) (electronic)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"2","key":"919_CR4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.7151\/dmgt.1365","volume":"27","author":"B. Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar B., \u0160pacapan S.: Edge connectivity of strong products of graphs. Discuss. Math. Graph Theory 27(2), 333\u2013343 (2007)","journal-title":"Discuss. Math. Graph Theory"},{"key":"919_CR5","unstructured":"Bre\u0161ar, B., \u0160pacapan, S.: Connectivity of direct products of graphs. Australas. J. Comb. (in press)"},{"key":"919_CR6","first-page":"129","volume":"102","author":"W.S. Chiue","year":"1999","unstructured":"Chiue W.S., Shieh B.S.: On connectivity of the Cartesian product of two graphs. Appl. Math. Comput. 102, 129\u2013137 (1999)","journal-title":"Appl. Math. Comput."},{"key":"919_CR7","first-page":"243","volume":"66","author":"B. Codenotti","year":"2003","unstructured":"Codenotti B., Gerace I., Resta G.: Some remarks on the Shannon capacity of odd cycles. Ars Combin. 66, 243\u2013257 (2003)","journal-title":"Ars Combin."},{"key":"919_CR8","first-page":"247","volume":"178","author":"W. D\u00f6rfler","year":"1970","unstructured":"D\u00f6rfler W., Imrich W.: \u00dcber das starke Produkt von endlichen Graphen. \u00d6sterreich. Akad. Wiss. Math.-Natur. Kl. S.-B. II 178, 247\u2013262 (1970)","journal-title":"Akad. Wiss. Math.-Natur. Kl. S.-B. II"},{"key":"919_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0012-365X(02)00870-1","volume":"271","author":"W. Goddard","year":"2003","unstructured":"Goddard W., Raines M.E., Slater P.J.: Distance and connectivity measures in permutation graphs. Discrete Math. 271, 61\u201370 (2003)","journal-title":"Discrete Math."},{"key":"919_CR10","volume-title":"Product Graphs: Structure and Recognition","author":"W. Imrich","year":"2000","unstructured":"Imrich W., Klav\u017ear S.: Product Graphs: Structure and Recognition. Wiley, New York (2000)"},{"key":"919_CR11","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1016\/j.disc.2005.09.019","volume":"306","author":"J. Jerebic","year":"2006","unstructured":"Jerebic J., Klav\u017ear S.: On induced and isometric embeddings of graphs into the strong product of paths. Dicrete Math. 306, 1358\u20131363 (2006)","journal-title":"Dicrete Math."},{"key":"919_CR12","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":"919_CR13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.jctb.2005.03.006","volume":"95","author":"J. K\u00f6rner","year":"2005","unstructured":"K\u00f6rner J., Pilotto C., Simonyi G.: Local chromatic number and Sperner capacity. J. Combin. Theory Ser. B 95, 101\u2013117 (2005)","journal-title":"J. Combin. Theory Ser. B"},{"key":"919_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1002\/jgt.20058","volume":"48","author":"D. Kr\u00e1l","year":"2005","unstructured":"Kr\u00e1l D., Maxov\u00e1 J., \u0160\u00e1mal R., Podbrdsk\u00fd P.: Hamilton cycles in strong products of graphs. J. Graph Theory 48, 299\u2013321 (2005)","journal-title":"J. Graph Theory"},{"key":"919_CR15","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1002\/jgt.20314","volume":"58","author":"D. Kr\u00e1l","year":"2008","unstructured":"Kr\u00e1l D., Stacho L.: Hamiltonian threshold for strong products of graphs. J. Graph Theory 58, 314\u2013328 (2008)","journal-title":"J. Graph Theory"},{"key":"919_CR16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.4064\/fm-70-1-59-101","volume":"70","author":"R. McKenzie","year":"1971","unstructured":"McKenzie R.: Cardinal multiplication of structures with a reflexive relation. Fund. Math. 70, 59\u2013101 (1971)","journal-title":"Fund. Math."},{"key":"919_CR17","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0166-218X(91)90047-Z","volume":"30","author":"B.L. Piazza","year":"1991","unstructured":"Piazza B.L., Ringeisen R.D.: Connectivity of generalized prisms over G. Discrete Appl. Math. 30, 229\u2013233 (1991)","journal-title":"Discrete Appl. Math."},{"key":"919_CR18","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.aml.2007.06.010","volume":"21","author":"S. \u0160pacapan","year":"2008","unstructured":"\u0160pacapan S.: Connectivity of Cartesian products of graphs. Appl. Math. Lett. 21, 682\u2013685 (2008)","journal-title":"Appl. Math. Lett."},{"key":"919_CR19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(01)00229-0","volume":"81","author":"A. Vesel","year":"2002","unstructured":"Vesel A., \u017derovnik J.: Improved lower bound on the Shannon capacity of C 7. Inform. Process. Lett. 81, 277\u2013282 (2002)","journal-title":"Inform. Process. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0919-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0919-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0919-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:30Z","timestamp":1559055510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0919-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,2]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["919"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0919-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,2]]}}}