{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T10:56:53Z","timestamp":1676458613185},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T00:00:00Z","timestamp":1259280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11786-009-0011-z","type":"journal-article","created":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T14:55:21Z","timestamp":1259333721000},"page":"3-15","source":"Crossref","is-referenced-by-count":1,"title":["Partitioning Bispanning Graphs into Spanning Trees"],"prefix":"10.1007","volume":"3","author":[{"given":"Matthias","family":"Baumgart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,27]]},"reference":[{"key":"11_CR1","unstructured":"Baumgart, M.: Partitioning bispanning graphs into spanning trees. Technical Report TUM-I0813, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen (2008)"},{"issue":"1","key":"11_CR2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1093\/qmath\/23.1.81","volume":"23","author":"J.A. Bondy","year":"1972","unstructured":"Bondy J.A.: Transversal matroids, base-orderable matroids and graphs. Q. J. Math. 23(1), 81\u201389 (1972)","journal-title":"Q. J. Math."},{"key":"11_CR3","first-page":"37","volume":"3","author":"O. Bor\u016fvka","year":"1926","unstructured":"Bor\u016fvka O.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ca Moravsk\u00e9 P\u0159\u00edrodov\u011bck\u00e9 Spole\u010dnosti 3, 37\u201358 (1926) (in Czech)","journal-title":"Pr\u00e1ca Moravsk\u00e9 P\u0159\u00edrodov\u011bck\u00e9 Spole\u010dnosti"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S000497270004140X","volume":"1","author":"R.A. Brualdi","year":"1969","unstructured":"Brualdi R.A.: Comments on bases in dependence structures. Bull. Aust. Math. Soc. 1, 161\u2013167 (1969)","journal-title":"Bull. Aust. Math. Soc."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0012-365X(73)90064-2","volume":"6","author":"T.H. Brylawski","year":"1973","unstructured":"Brylawski T.H.: Some properties of basic families of subsets. Discrete Math. 6, 333\u2013341 (1973)","journal-title":"Discrete Math."},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","volume":"27","author":"G.A. Dirac","year":"1952","unstructured":"Dirac G.A.: A property of 4-chromatic graphs and some remarks on critical graphs. J. Lond. Math. Soc. 27, 85\u201392 (1952)","journal-title":"J. Lond. Math. Soc."},{"key":"11_CR7","unstructured":"Ingleton, A.W.: Non-base-orderable matroids. In: Proceedings of the 5th British Combinatorial Conference (BCC\u201975). Congressus Numerantium, vol. 15, pp. 355\u2013359 (1975)"},{"issue":"2","key":"11_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF02579450","volume":"7","author":"M. Kano","year":"1987","unstructured":"Kano M.: Maximum and k-th maximal spanning trees of a weighted graph. Combinatorica 7(2), 205\u2013214 (1987)","journal-title":"Combinatorica"},{"key":"11_CR9","first-page":"988","volume":"61-A","author":"T. Kawamoto","year":"1978","unstructured":"Kawamoto T., Kajitani Y., Shinoda S.: On the second maximal spanning trees of a weighted graph (in Japanese). Trans. IECE Jpn. 61-A, 988\u2013995 (1978)","journal-title":"Trans. IECE Jpn."},{"issue":"4","key":"11_CR10","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1006\/eujc.1999.0355","volume":"21","author":"J. Keijsper","year":"2000","unstructured":"Keijsper J., Pendavingh R., Schrijver A.: Adjacency, inseparability, and base orderability in matroids. Eur. J. Comb. 21(4), 487\u2013502 (2000)","journal-title":"Eur. J. Comb."},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7, 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"11_CR12","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01305236","volume":"12","author":"E.W. Mayr","year":"1992","unstructured":"Mayr E.W., Plaxton C.G.: On the spanning trees of weighted graphs. Combinatorica 12(4), 433\u2013447 (1992)","journal-title":"Combinatorica"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"11_CR14","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A.: Combinatorial Optimization. Springer, Berlin (2003)"},{"key":"11_CR15","volume-title":"Matroid Theory","author":"D. Welsh","year":"1976","unstructured":"Welsh D.: Matroid Theory. Academic Press, London (1976)"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0011-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-009-0011-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0011-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T22:32:27Z","timestamp":1559428347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-009-0011-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,27]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s11786-009-0011-z","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,27]]}}}