{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T12:06:20Z","timestamp":1769515580387,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,6]],"date-time":"2016-09-06T00:00:00Z","timestamp":1473120000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301480"],"award-info":[{"award-number":["11301480"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11371021"],"award-info":[{"award-number":["11371021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of Ningbo","doi-asserted-by":"publisher","award":["2014A610030, 2015A610167"],"award-info":[{"award-number":["2014A610030, 2015A610167"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of Ningbo","doi-asserted-by":"publisher","award":["2013A610067"],"award-info":[{"award-number":["2013A610067"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0075-z","type":"journal-article","created":{"date-parts":[[2016,9,6]],"date-time":"2016-09-06T07:05:42Z","timestamp":1473145542000},"page":"141-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["On minimally 2-connected graphs with generalized connectivity $$\\kappa _{3}=2$$ \u03ba 3 = 2"],"prefix":"10.1007","volume":"34","author":[{"given":"Shasha","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haina","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,6]]},"reference":[{"key":"75_CR1","volume-title":"Extremal graph theory","author":"B Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s B (1978) Extremal graph theory. Academic Press, London"},{"key":"75_CR2","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, New York"},{"key":"75_CR3","first-page":"1","volume":"2","author":"G Chartrand","year":"1984","unstructured":"Chartrand G, Kapoor SF, Lesniak L, Lick DR (1984) Generalized connectivity in graphs. Bull Bombay Math Colloq 2:1\u20136","journal-title":"Bull Bombay Math Colloq"},{"issue":"4","key":"75_CR4","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"},{"issue":"2","key":"75_CR5","first-page":"321","volume":"57","author":"R Gu","year":"2014","unstructured":"Gu R, Li X, Shi Y (2014) The generalized 3-connectivity of random graphs. Acta Math Sin (Chin Ser) 57(2):321\u2013330","journal-title":"Acta Math Sin (Chin Ser)"},{"key":"75_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0095-8956(85)90083-8","volume":"38","author":"M Hager","year":"1985","unstructured":"Hager M (1985) Pendant tree-connectivity. J Comb Theory 38:179\u2013189","journal-title":"J Comb Theory"},{"key":"75_CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(86)90068-3","volume":"59","author":"M Hager","year":"1986","unstructured":"Hager M (1986) Path-connectivity in graphs. Discret Math 59:53\u201359","journal-title":"Discret Math"},{"key":"75_CR8","unstructured":"Li S (2012) Some topics on generalized connectivity of graphs, PhD Thesis, Nankai University"},{"key":"75_CR9","first-page":"65","volume":"104","author":"S Li","year":"2012","unstructured":"Li S, Li W, Li X (2012) The generalized connectivity of complete bipartite graphs. Ars Comb 104:65\u201379","journal-title":"Ars Comb"},{"issue":"1","key":"75_CR10","first-page":"103","volume":"37","author":"S Li","year":"2014","unstructured":"Li S, Li W, Li X (2014) The generalized connectivity of complete equipartition $$3$$ 3 -partite graphs. Bull Malays Math Sci Soc 37(1):103\u2013121","journal-title":"Bull Malays Math Sci Soc"},{"key":"75_CR11","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"},{"key":"75_CR12","first-page":"209","volume":"51","author":"S Li","year":"2011","unstructured":"Li S, Li X, Shi Y (2011) The minimal size of a graph with generalized connectivity $$\\kappa _{3}= 2$$ \u03ba 3 = 2 . Australas J Comb. 51:209\u2013220","journal-title":"Australas J Comb."},{"key":"75_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"},{"key":"75_CR14","doi-asserted-by":"crossref","unstructured":"Li S, Shi Y, Tu J (2016) The generalized 3-connectivity of Cayley graphs generated by trees and cycles, submitted","DOI":"10.1007\/s00373-017-1837-9"},{"key":"75_CR15","doi-asserted-by":"crossref","unstructured":"Li X, Mao Y (2016) A survey on the generalized connectivity of graphs, arXiv:1207.1838v9","DOI":"10.1007\/978-3-319-33828-6"},{"key":"75_CR16","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":"75_CR17","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"},{"key":"75_CR18","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\/article\/10.1007\/s10878-016-0075-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0075-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0075-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T02:44:40Z","timestamp":1568342680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0075-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,6]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["75"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0075-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,6]]}}}