{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T23:37:34Z","timestamp":1780529854377,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,18]],"date-time":"2015-09-18T00:00:00Z","timestamp":1442534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Scientific Research Funds of Huaqiao University","award":["14BS311"],"award-info":[{"award-number":["14BS311"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11071130, 11161037"],"award-info":[{"award-number":["11071130, 11161037"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Science Found of Qinghai Province","award":["2014-ZJ-907"],"award-info":[{"award-number":["2014-ZJ-907"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10878-015-9955-x","type":"journal-article","created":{"date-parts":[[2015,9,18]],"date-time":"2015-09-18T07:10:28Z","timestamp":1442560228000},"page":"275-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A solution to a conjecture on the generalized connectivity of graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Lily","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengmeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaping","family":"Mao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,18]]},"reference":[{"key":"9955_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory, GTM 244","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory, GTM 244. Springer, Berlin"},{"key":"9955_CR2","first-page":"1","volume":"2","author":"G Chartrand","year":"1984","unstructured":"Chartrand G, Kappor S, Lesniak L, Lick D (1984) Generalized connectivity in graphs. Bull Bombay Math Colloq 2:1\u20136","journal-title":"Bull Bombay Math Colloq"},{"issue":"4","key":"9955_CR3","first-page":"360","volume":"55","author":"G Chartrand","year":"2010","unstructured":"Chartrand G, Okamoto F, Zhang P (2010) Rainbow trees in graphs and generalized connectivity. Networks 55(4):360\u2013367","journal-title":"Networks"},{"key":"9955_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02614374","volume":"78","author":"M Gr\u00f6tschel","year":"1997","unstructured":"Gr\u00f6tschel M (1997) The Steiner tree packing problem in $$VLSI$$ V L S I design. Math Program 78:265\u2013281","journal-title":"Math Program"},{"key":"9955_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02592086","volume":"72","author":"M Gr\u00f6tschel","year":"1996","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1996) Packing Steiner trees: a cutting plane algorithm and commputational results. Math Program 72:125\u2013145","journal-title":"Math Program"},{"key":"9955_CR6","unstructured":"Jain K, Mahdian M, Salavatipour M (2003) Packing Steiner trees. In: Proceedings of the 14th $$ACM$$ A C M symposium on discterte algorithms, Baltimore, pp. 266\u2013274"},{"key":"9955_CR7","unstructured":"Li S (2012) Some topics on generalized connectivity of graphs. Ph.D. Thesis, Nankai University"},{"key":"9955_CR8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10878-011-9399-x","volume":"24","author":"S Li","year":"2012","unstructured":"Li S, Li X (2012) Note on the hardness of generalized connectivity. J Comb Optim 24:389\u2013396","journal-title":"J Comb Optim"},{"issue":"1","key":"9955_CR9","first-page":"339","volume":"16","author":"X Li","year":"2014","unstructured":"Li X, Mao Y (2014) The generalied $$3$$ 3 -connectivity of lexigraphical product graphs. Discret Math Theor Comput Sci 16(1):339\u2013354","journal-title":"Discret Math Theor Comput Sci"},{"key":"9955_CR10","doi-asserted-by":"crossref","unstructured":"Li X, Mao Y (2015a) On extremal graphs with at most $$\\ell $$ \u2113 \u00a0internally disjoint Steiner trees connecting any $$n-1$$ n - 1 vertices. Graphs Comb","DOI":"10.1007\/s00373-014-1500-7"},{"key":"9955_CR11","doi-asserted-by":"crossref","unstructured":"Li X, Mao Y (2015b) Nordhaus\u2013Gaddum-type results for the generalized edge-connectivity of graphs. Discret Appl Math 185:102\u2013112","DOI":"10.1016\/j.dam.2014.12.009"},{"key":"9955_CR12","unstructured":"Li X, Mao Y (2015c) The minimal size of a graph with given generalized 3-edge-connectivity. Ars Comb 118:63\u201372"},{"key":"9955_CR13","doi-asserted-by":"crossref","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 (2010) Sharp bounds for the generalized connectivity $$\\kappa _3(G)$$ \u03ba 3 ( G ) . Discret Math 310:2147\u20132163","journal-title":"Discret Math"},{"issue":"1","key":"9955_CR14","doi-asserted-by":"crossref","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 (2012a) The generalied 3-connectivity of Cartesian product graphs. Discret Math Theor Comput Sci 14(1):43\u201354","journal-title":"Discret Math Theor Comput Sci"},{"key":"9955_CR15","unstructured":"Li S, Li W, Li X (2012b) The generalized connectivity of complete bipartite graphs. Ars Comb 104:65\u201379"},{"key":"9955_CR16","unstructured":"Li S, Li W, Li X (2014a) The generalized connectivity of complete equipartition $$3$$ 3 -partite graphs. Bull. Malays Math Sci Soc 37(1):103\u2013121"},{"key":"9955_CR17","unstructured":"Li X, Mao Y, Sun Y (2014b) On the generalized (edge-)connectivity of graphs. Australas J Comb 58(2):304\u2013319"},{"key":"9955_CR18","first-page":"279","volume":"74","author":"F Okamoto","year":"2010","unstructured":"Okamoto F, Zhang P (2010) The tree connectivity of regular complete bipartite graphs. J Comb Math Comb Comput 74:279\u2013293","journal-title":"J Comb Math Comb Comput"},{"key":"9955_CR19","volume-title":"Algorithms for VLSI physical design automation","author":"NA Sherwani","year":"1999","unstructured":"Sherwani NA (1999) Algorithms for VLSI physical design automation, 3rd edn. Kluwer Academic Publishers, London","edition":"3"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9955-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9955-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9955-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9955-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:28Z","timestamp":1559262208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9955-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,18]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9955"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9955-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,18]]}}}