{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:19:49Z","timestamp":1760523589061,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,1,27]],"date-time":"2018-01-27T00:00:00Z","timestamp":1517011200000},"content-version":"tdm","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":["11571294","11671336"],"award-info":[{"award-number":["11571294","11671336"]}],"id":[{"id":"10.13039\/501100001809","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":[[2018,5]]},"DOI":"10.1007\/s10878-018-0249-y","type":"journal-article","created":{"date-parts":[[2018,1,27]],"date-time":"2018-01-27T11:50:33Z","timestamp":1517053833000},"page":"997-1008","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Edge-disjoint spanning trees and the number of maximum state circles of a graph"],"prefix":"10.1007","volume":"35","author":[{"given":"Xiaoli","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian\u2019an","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,27]]},"reference":[{"key":"249_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. The Macmillan Press Ltd, London"},{"key":"249_CR2","first-page":"623","volume":"63","author":"X Cheng","year":"2010","unstructured":"Cheng X, Liu S, Zhang H, Qiu W (2010) Fabrication of a family of pyramidal links and their genus. MATCH Commun Math Comput Chem 63:623\u2013636","journal-title":"MATCH Commun Math Comput Chem"},{"key":"249_CR3","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BFb0120910","volume":"13","author":"J Clausen","year":"1980","unstructured":"Clausen J, Hansen LA (1980) Finding \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                   edge disjoint spanning trees of minimum total weight network: an application of matroid theory. Math Program Stud 13:88\u2013101","journal-title":"Math Program Stud"},{"key":"249_CR4","doi-asserted-by":"publisher","first-page":"258","DOI":"10.2307\/1970181","volume":"69","author":"RH Crowell","year":"1959","unstructured":"Crowell RH (1959) Genus of alternating link types. Ann Math 69:258\u2013275","journal-title":"Ann Math"},{"key":"249_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1215\/S0012-7094-86-05336-6","volume":"53","author":"D Gabai","year":"1986","unstructured":"Gabai D (1986) Genera of the alternating links. Duke Math J 53:677\u2013681","journal-title":"Duke Math J"},{"key":"249_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(83)90031-5","volume":"16","author":"D Gusfield","year":"1983","unstructured":"Gusfield D (1983) Connectivity and edge-disjoint spanning trees. Inform Process Lett 16:87\u201389","journal-title":"Inform Process Lett"},{"key":"249_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held M, Karp RM (1971) The traveling salesman and minimum spaning trees. Math Program 1:6\u201325","journal-title":"Math Program"},{"key":"249_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1090\/conm\/089\/1006479","volume":"89","author":"M Hobbs","year":"1989","unstructured":"Hobbs M (1989) Computing edge-toughness and fractional arboricity. Contemp Math 89:89\u2013106","journal-title":"Contemp Math"},{"key":"249_CR9","unstructured":"Jin X, Ge J, Cheng X, Lin Y (2015) The number of circles of a maximum state of a plane graph with applications. Acta Math Appl Sin Engl Ser"},{"key":"249_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0095-8956(74)90087-2","volume":"17","author":"S Kundu","year":"1974","unstructured":"Kundu S (1974) Bounds on the number of egde-disjoint spanning trees. J Comb Theory Ser B 17:199\u2013203","journal-title":"J Comb Theory Ser B"},{"key":"249_CR11","doi-asserted-by":"publisher","first-page":"1250129","DOI":"10.1142\/S0218216512501295","volume":"21","author":"S Liu","year":"2012","unstructured":"Liu S, Zhang H (2012) Genera of the links derived from 2-connected plane graphs. J Knot Theory Ramif. 21:1250129","journal-title":"J Knot Theory Ramif."},{"issue":"94\u2013105","key":"249_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.2969\/jmsj\/01030235","volume":"10","author":"K Murasugi","year":"1958","unstructured":"Murasugi K (1958) On the genus of the alternating knot, I, II. J Math Soc Jpn 10(94\u2013105):235\u2013248","journal-title":"J Math Soc Jpn"},{"key":"249_CR13","doi-asserted-by":"publisher","first-page":"1450016","DOI":"10.1142\/S0218216514500163","volume":"23","author":"T Nakamura","year":"2014","unstructured":"Nakamura T, Nakanishi Y, Satoh S, Tomiyama Y (2014) The state numbers of virtual knot. J Knot Theory Ramif 23:1450016","journal-title":"J Knot Theory Ramif"},{"key":"249_CR14","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"CSJA Nash-Williams","year":"1961","unstructured":"Nash-Williams CSJA (1961) Edge-disjoint spanning trees of finite graphs. J Lond. Math Soc 36:445\u2013450","journal-title":"J Lond. Math Soc"},{"key":"249_CR15","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1287\/moor.10.4.701","volume":"10","author":"J Roskind","year":"1985","unstructured":"Roskind J, Tarjan R (1985) A note on finding minimum-cost edge-disjoint spanning trees. Math Oper Res 10:701\u2013708","journal-title":"Math Oper Res"},{"key":"249_CR16","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/BF01448044","volume":"110","author":"H Seifert","year":"1935","unstructured":"Seifert H (1935) \u00dcber das Geschlecht von Knoten. Math Ann 110:571\u2013592","journal-title":"Math Ann"},{"key":"249_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0190(74)90024-6","volume":"3","author":"RE Tarjan","year":"1974","unstructured":"Tarjan RE (1974) A good algorithm for edge-disjoint branching. Inform Process Lett 3:51\u201353","journal-title":"Inform Process Lett"},{"key":"249_CR18","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF00268499","volume":"6","author":"RE Tarjan","year":"1976","unstructured":"Tarjan RE (1976) Edge-disjoint spanning trees and depth-first search. Acta Inform 6:171\u2013185","journal-title":"Acta Inform"},{"key":"249_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0040-9383(87)90003-6","volume":"26","author":"MB Thistlethwaite","year":"1987","unstructured":"Thistlethwaite MB (1987) A spanning tree expansion of the Jones polynomial. Topology 26:297\u2013309","journal-title":"Topology"},{"key":"249_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"WT Tutte","year":"1961","unstructured":"Tutte WT (1961) On the problem of decomposing a graph into \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                   connected factors. J Lond Math Soc 36:221\u2013230","journal-title":"J Lond Math Soc"},{"key":"249_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","volume":"4","author":"AC Yao","year":"1975","unstructured":"Yao AC (1975) An \n                    \n                      \n                    \n                    $$O(|E|log~log|V|)$$\n                    \n                      \n                        \n                          O\n                          (\n                          |\n                          E\n                          |\n                          l\n                          o\n                          g\n                          \n                          l\n                          o\n                          g\n                          |\n                          V\n                          |\n                          )\n                        \n                      \n                    \n                   algorithm for finding minimum spanning trees. Inform Process Lett 4:21\u201323","journal-title":"Inform Process Lett"},{"key":"249_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1367064.1367075","volume":"4","author":"C Zhang","year":"2008","unstructured":"Zhang C, Ou Y (2008) Clustering, community partition and disjoint spanning trees. ACM Trans Algorithms 4:35","journal-title":"ACM Trans Algorithms"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0249-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0249-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0249-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T20:02:59Z","timestamp":1548532979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0249-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,27]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0249-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,1,27]]},"assertion":[{"value":"27 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}