{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T14:53:21Z","timestamp":1768748001279,"version":"3.49.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319126906","type":"print"},{"value":"9783319126913","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_31","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"412-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs"],"prefix":"10.1007","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[]},{"given":"Jun","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0020-0190(99)00033-2","volume":"70","author":"B Barden","year":"1999","unstructured":"Barden, B., Libeskind-Hadas, R., Davis, J., Williams, W.: On edge-disjoint spanning trees in hypercubes. Infor. Proces. Lett. 70, 13\u201316 (1999)","journal-title":"Infor. Proces. Lett."},{"key":"31_CR2","volume-title":"Topics in Structural Graph Theory","author":"LW Beineke","year":"2013","unstructured":"Beineke, L.W., Wilson, R.J.: Topics in Structural Graph Theory. Cambrige University Press, Cambrige (2013)"},{"key":"31_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory. GTM 244","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. GTM 244. Springer, Berlin (2008)"},{"key":"31_CR4","doi-asserted-by":"publisher","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, 333\u2013343 (2007)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"4","key":"31_CR5","first-page":"360","volume":"55","author":"G Chartrand","year":"2010","unstructured":"Chartrand, G., Okamoto, F., Zhang, P.: Rainbow trees in graphs and generalized connectivity. Networks 55(4), 360\u2013367 (2010)","journal-title":"Networks"},{"key":"31_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0255-1","volume-title":"Steiner Trees in Industry","author":"X Cheng","year":"2001","unstructured":"Cheng, X., Du, D.: Steiner Trees in Industry. Kluwer Academic Publisher, Dordrecht (2001)"},{"key":"31_CR7","doi-asserted-by":"publisher","DOI":"10.1142\/6729","volume-title":"Steiner Tree Problems in Computer Communication Networks","author":"D Du","year":"2008","unstructured":"Du, D., Hu, X.: Steiner Tree Problems in Computer Communication Networks. World Scientific, River Edge (2008)"},{"issue":"4","key":"31_CR8","doi-asserted-by":"crossref","first-page":"56","DOI":"10.37236\/2974","volume":"19","author":"M Feng","year":"2012","unstructured":"Feng, M., Xu, M., Wang, K.: Identifying codes of lexicographic product of graphs. Electron. J. Comb. 19(4), 56\u201363 (2012)","journal-title":"Electron. J. Comb."},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02614374","volume":"78","author":"M Gr\u00f6tschel","year":"1997","unstructured":"Gr\u00f6tschel, M.: The Steiner tree packing problem in $$VLSI$$ design. Math. Program. 78, 265\u2013281 (1997)","journal-title":"Math. Program."},{"key":"31_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klavz\u0306ar, S.: Handbook of Product Graphs, 2nd edn. CRC Press, Boca Raton (2011)","edition":"2"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0095-8956(85)90083-8","volume":"38","author":"M Hager","year":"1985","unstructured":"Hager, M.: Pendant tree-connectivity. J. Combin. Theory 38, 179\u2013189 (1985)","journal-title":"J. Combin. Theory"},{"key":"31_CR12","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":"31_CR13","doi-asserted-by":"publisher","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-Europ. J. Math. 1, 93\u201398 (2008)","journal-title":"Asian-Europ. J. Math."},{"issue":"3","key":"31_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TPDS.2003.1189580","volume":"14","author":"S Ku","year":"2003","unstructured":"Ku, S., Wang, B., Hung, T.: Constructing edge-disjoint spanning trees in product networks. IEEE Trans. Parallel Distrib. Syst. 14(3), 213\u2013221 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"31_CR15","first-page":"949","volume":"42","author":"F Li","year":"2012","unstructured":"Li, F., Xu, Z., Zhao, H., Wang, W.: On the number of spanning trees of the lexicographic product of networks. Sci. China Ser. F 42, 949\u2013959 (2012)","journal-title":"Sci. China Ser. F"},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.commatsci.2011.09.003","volume":"14","author":"H Li","year":"2012","unstructured":"Li, H., Li, X., Sun, Y.: The generalied 3-connectivity of Cartesian product graphs. Discrete Math. Theor. Comput. Sci. 14(1), 43\u201354 (2012)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"31_CR17","unstructured":"Li, H., Li, X., Mao, Y.: On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices. Bull. Malays. Math. Sci. Soc. 37(2,3), 747\u2013756 (2014)"},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/j.disc.2010.04.011","volume":"310","author":"S Li","year":"2010","unstructured":"Li, S., Li, X., Zhou, W.: Sharp bounds for the generalized connectivity $$\\kappa _3(G)$$. Discrete Math. 310, 2147\u20132163 (2010)","journal-title":"Discrete Math."},{"key":"31_CR19","unstructured":"Li, S., Li, W., Li, X.: The generalized connectivity of complete equipartition $$3$$-partite graphs. Bull. Malays. Math. Sci. Soc. 37(1,2), 103\u2013121 (2014)"},{"issue":"1","key":"31_CR20","first-page":"339","volume":"16","author":"X Li","year":"2014","unstructured":"Li, X., Mao, Y.: The generalized 3-connectivity of lexicographic product graphs. Discrete Math. Theor. Comput. Sci. 16(1), 339\u2013354 (2014)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"31_CR21","unstructured":"Li, X., Mao, Y.: The minimal size of a graph with given generalized 3-edge-connectivity. Accepted for publication in Ars Comb"},{"key":"31_CR22","first-page":"304","volume":"58","author":"X Li","year":"2014","unstructured":"Li, X., Mao, Y., Sun, Y.: On the generalized (edge-)connectivity of graphs. Austral. J. Comb. 58, 304\u2013319 (2014)","journal-title":"Austral. J. Comb."},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"CStJA Nash Williams","year":"1961","unstructured":"Nash Williams, CStJA: Edge-disjonint spanning trees of finite graphs. J. London Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"31_CR24","first-page":"231","volume":"116","author":"OR Oellermann","year":"1996","unstructured":"Oellermann, O.R.: Connectivity and edge-connectivity in graphs: a survey. Cong. Numer. 116, 231\u2013252 (1996)","journal-title":"Cong. Numer."},{"issue":"1","key":"31_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-010-0973-2","volume":"27","author":"K Ozeki","year":"2011","unstructured":"Ozeki, K., Yamashita, T.: Spanning trees: a survey. Graphs Combin. 27(1), 1\u201326 (2011)","journal-title":"Graphs Combin."},{"key":"31_CR26","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(00)00066-2","volume":"230","author":"E Palmer","year":"2001","unstructured":"Palmer, E.: On the spanning tree packing number of a graph: a survey. Discrete Math. 230, 13\u201321 (2001)","journal-title":"Discrete Math."},{"key":"31_CR27","volume-title":"Algorithms for $$VLSI$$ Physical Design Automation","author":"N Sherwani","year":"1999","unstructured":"Sherwani, N.: Algorithms for $$VLSI$$ Physical Design Automation, 3rd edn. Kluwer Academic Publishers, London (1999)","edition":"3"},{"key":"31_CR28","unstructured":"Sun, Y.: Generalized 3-edge-connectivity of Cartesian product graphs. Accepted for publication in Czech. Math. J."},{"key":"31_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W Tutte","year":"1961","unstructured":"Tutte, W.: On the problem of decomposing a graph into $$n$$ connected factors. J. London Math. Soc. 36, 221\u2013230 (1961)","journal-title":"J. London Math. Soc."},{"issue":"1","key":"31_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190130103","volume":"13","author":"L Volkmann","year":"1989","unstructured":"Volkmann, L.: Edge connectivity in $$p$$-partite graphs. J. Graph Theory 13(1), 1\u20136 (1989)","journal-title":"J. Graph Theory"},{"key":"31_CR31","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.jctb.2011.06.003","volume":"102","author":"D West","year":"2012","unstructured":"West, D., Wu, H.: Packing Steiner trees and $$S$$-connectors in graphs. J. Comb. Theory Ser. B 102, 186\u2013205 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"key":"31_CR32","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.disc.2005.11.010","volume":"306","author":"J Xu","year":"2006","unstructured":"Xu, J., Yang, C.: Connectivity of Cartesian product graphs. Discrete Math. 306, 159\u2013165 (2006)","journal-title":"Discrete Math."},{"key":"31_CR33","first-page":"3","volume":"111","author":"C Yang","year":"2013","unstructured":"Yang, C., Xu, J.: Connectivity of lexicographic product and direct product of graphs. Ars Comb. 111, 3\u201312 (2013)","journal-title":"Ars Comb."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:09:32Z","timestamp":1676419772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}