{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T17:04:52Z","timestamp":1782061492710,"version":"3.54.5"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T00:00:00Z","timestamp":1378252800000},"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":[[2014,11]]},"DOI":"10.1007\/s00373-013-1359-z","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T08:52:45Z","timestamp":1378198365000},"page":"1453-1461","source":"Crossref","is-referenced-by-count":6,"title":["Characterizations of Strength Extremal Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Xiaofeng","family":"Gu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ping","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Senmei","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,9,4]]},"reference":[{"key":"1359_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(85)90087-5","volume":"38","author":"E.T. Boesch","year":"1985","unstructured":"Boesch E.T., McHugh J.A.M.: An edge extremal result for subcohesion. J. Comb. Theory Ser. B 38, 1\u20137 (1985)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1359_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J.A. Bondy","year":"2008","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"1359_CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0166-218X(92)90002-R","volume":"40","author":"P.A. Catlin","year":"1992","unstructured":"Catlin P.A., Grossman J.W., Hobbs A.M., Lai H.-J.: Fractional arboricity, strength and principal partitions in graphs and matroids. Discret. Appl. Math. 40, 285\u2013302 (1992)","journal-title":"Discret. Appl. Math."},{"key":"1359_CR4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W.H. Cunningham","year":"1985","unstructured":"Cunningham W.H.: Optimal attack and reinforcement of a network. J. ACM 32, 549\u2013561 (1985)","journal-title":"J. ACM"},{"key":"1359_CR5","first-page":"129","volume":"63","author":"R. Haas","year":"2002","unstructured":"Haas R.: Characterizations of arboricity of graphs. Ars Comb. 63, 129\u2013137 (2002)","journal-title":"Ars Comb."},{"key":"1359_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190140207","volume":"14","author":"H.-J. Lai","year":"1990","unstructured":"Lai H.-J.: The size of strength-maximal graphs. J. Graph Theory 14, 187\u2013197 (1990)","journal-title":"J. Graph Theory"},{"key":"1359_CR7","doi-asserted-by":"crossref","first-page":"244","DOI":"10.4236\/am.2010.13030","volume":"1","author":"H.-J. Lai","year":"2010","unstructured":"Lai H.-J., Li P., Liang Y., Xu J.: Reinforcing a matroid to have k disjoint bases. Appl. Math. 1, 244\u2013249 (2010)","journal-title":"Appl. Math."},{"key":"1359_CR8","unstructured":"Li, P.: Cycles and bases of graphs and matroids. Ph.D. dissertation, West Virginia University (2012)"},{"key":"1359_CR9","unstructured":"Li, P., Lai, H.-J., Liang, Y.: Characterization of removable elements with respect to having k disjoint bases in a matroid. Discret. Appl. Math. 160, 2445\u20132451 (2012)"},{"key":"1359_CR10","first-page":"113","volume":"93","author":"D. Liu","year":"2009","unstructured":"Liu D., Lai H.-J., Chen Z.-H.: Reinforcing the number of disjoint spanning trees. Ars Comb. 93, 113\u2013127 (2009)","journal-title":"Ars Comb."},{"key":"1359_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"W. Mader","year":"1971","unstructured":"Mader W.: Minimale n-fach kantenzusammenh\u00e4ngende graphen. Math. Ann. 191, 21\u201328 (1971)","journal-title":"Math. Ann."},{"key":"1359_CR12","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/0122040","volume":"22","author":"D. Matula","year":"1972","unstructured":"Matula D.: K-components, clusters, and slicings in graphs. SIAM J. Appl. Math. 22, 459\u2013480 (1972)","journal-title":"SIAM J. Appl. Math."},{"key":"1359_CR13","doi-asserted-by":"crossref","unstructured":"Matula, D.: Determining edge connectivity in O(mn). In: Proceedings of 28th Symp. on Foundations of Computer Science, pp 249\u2013251 (1987)","DOI":"10.1109\/SFCS.1987.19"},{"key":"1359_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(77)90162-5","volume":"17","author":"J. Mitchem","year":"1977","unstructured":"Mitchem J.: An extension of Brooks\u2019 theorem to n-degenerate graphs. Discret. Math. 17, 291\u2013298 (1977)","journal-title":"Discret. Math."},{"key":"1359_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C.St.J.A. Nash-williams","year":"1961","unstructured":"Nash-williams C.St.J.A.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. Lond. Math. Soc."},{"key":"1359_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0012-365X(00)00066-2","volume":"230","author":"E.M. Palmer","year":"2001","unstructured":"Palmer E.M.: On the spanning tree packing number of a graph, a survey. Discret. Math. 230, 13\u201321 (2001)","journal-title":"Discret. Math."},{"key":"1359_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W.T. Tutte","year":"1961","unstructured":"Tutte W.T.: On the problem of decomposing a graph into n factors. J. Lond. Math. Soc. 36, 221\u2013230 (1961)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1359-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1359-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1359-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T00:58:19Z","timestamp":1563843499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1359-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,4]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1359"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1359-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,4]]}}}