{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:07:16Z","timestamp":1770818836754,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,14]],"date-time":"2011-05-14T00:00:00Z","timestamp":1305331200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10878-011-9399-x","type":"journal-article","created":{"date-parts":[[2011,5,13]],"date-time":"2011-05-13T20:31:24Z","timestamp":1305318684000},"page":"389-396","source":"Crossref","is-referenced-by-count":59,"title":["Note on the hardness of generalized connectivity"],"prefix":"10.1007","volume":"24","author":[{"given":"Shasha","family":"Li","sequence":"first","affiliation":[]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,14]]},"reference":[{"key":"9399_CR1","series-title":"GTM","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. GTM, vol 244. Springer, Berlin"},{"issue":"4","key":"9399_CR2","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":"9399_CR3","unstructured":"Li S, Li W, Li X (2010a) The generalized connectivity of complete bipartite graphs, arXiv:1012.5710v1 [math.CO]"},{"key":"9399_CR4","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 (2010b) Sharp bounds for the generalized connectivity \u03ba 3(G). Discrete Math 310:2147\u20132163","journal-title":"Discrete Math"},{"key":"9399_CR5","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":"9399_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson N, Seymour P (1995) Graph minors XIII. The disjoint paths problem. J Comb Theory, Ser B 63:65\u2013110","journal-title":"J Comb Theory, Ser B"},{"key":"9399_CR7","volume-title":"Algorithms for VLSI physical design automation","author":"NA Sherwani","year":"1999","unstructured":"Sherwani NA Algorithms for VLSI physical design automation, 3rd edn. Kluwer Academic, London (1999)","edition":"3"},{"key":"9399_CR8","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney H (1932) Congruent graphs and the connectivity of graphs and the connectivity of graphs. Am J Math 54:150\u2013168","journal-title":"Am J Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9399-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9399-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9399-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:15Z","timestamp":1559276595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9399-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,14]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9399"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9399-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,14]]}}}