{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:33Z","timestamp":1759131993937},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":[[1994,3]]},"DOI":"10.1007\/bf01202468","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:52:41Z","timestamp":1108741961000},"page":"29-45","source":"Crossref","is-referenced-by-count":54,"title":["Independent trees in graphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Andreas","family":"Huck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","volume":"9","author":"J. Cheriyan","year":"1988","unstructured":"Cheriyan, J., Maheshwari, S.N.: Finding nonseparating induced cycles and independent spanning trees in 3 ? connected graphs. J. Algorithms9, 507?537 (1988)","journal-title":"J. Algorithms"},{"key":"CR2","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1969","unstructured":"Edmonds, J.: Submodular functions, matroids and certain polyhedra. In: Combinatorial Structures and Their Applications, R. Guy et al, Eds. Gordon and Breach, New York, 1969, pp. 69?87"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comp.2, 135?158 (1973)","journal-title":"SIAM J. Comp."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, R.: The multi-tree approach to reliability in distributed networks. Proceedings 25th Annual IEEE Symposium on Foundations of Computer Sciences, 1984, pp. 137?147","DOI":"10.1109\/SFCS.1984.715910"},{"issue":"6","key":"CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0020-0190(92)90230-S","volume":"42","author":"S. Khuller","year":"1992","unstructured":"Khuller, S., Schieber, B.: On independent spanning trees. Inform. Process. Lett.42, (6), 321?323 (1992)","journal-title":"Inform. Process. Lett."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","volume":"3","author":"W. Mader","year":"1978","unstructured":"Mader, W.: A reduction method for edge-connectivity in graphs. Ann. discrete Math3, 145?164 (1978)","journal-title":"Ann. discrete Math"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02582931","volume":"1","author":"W. Mader","year":"1985","unstructured":"Mader, W.: Path in graphs, reducings the edge-connectivity only by two. Graphs and Combinatorics1, 81?89 (1985)","journal-title":"Graphs and Combinatorics"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM J. Comp.1, 146?160 (1972)","journal-title":"SIAM J. Comp."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.3190110309","volume":"11","author":"R.W. Whitty","year":"1987","unstructured":"Whitty, R.W.: Vertex-disjoint paths and edge-disjoint branchings in directed graphs. J. Graph Theory11, 349?358 (1987)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202468.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202468\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:01:51Z","timestamp":1556730111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01202468"],"URL":"https:\/\/doi.org\/10.1007\/bf01202468","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}