{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:31:57Z","timestamp":1768782717838,"version":"3.49.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1007\/bf02579383","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:20:17Z","timestamp":1174602017000},"page":"221-233","source":"Crossref","is-referenced-by-count":41,"title":["Packing and covering a tree by subtrees"],"prefix":"10.1007","volume":"6","author":[{"given":"I.","family":"B\u00e1r\u00e1ny","sequence":"first","affiliation":[]},{"given":"L. A.","family":"Wolsey","sequence":"additional","affiliation":[]},{"given":"J.","family":"Edmonds","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579383_CR1","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0121006","volume":"22","author":"I. B\u00e1r\u00e1ny","year":"1984","unstructured":"I. B\u00e1r\u00e1ny, T. J. Van Roy, andL. A. Wolsey, Uncapacitated Lot-Sizing: The Convex Hull-of Solutions,Mathematical Programming Study,22 (1984), 32\u201343.","journal-title":"Mathematical Programming Study"},{"key":"BF02579383_CR2","unstructured":"A. Frank, Some Polynomial Algorithms for Certain Graphs and Hypergraphs,Proceedings of the 5th British Combinatorial Conference, Congressus Numerantium XV,Utilitas Math., Winnipeg (1976)."},{"key":"BF02579383_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"F. Gavril, The intersection Graphs of Subtrees in Trees are Exactly the Chordal Graphs,Journal of Combinatorial Theory, B 16, (1974), 47\u201356.","journal-title":"Journal of Combinatorial Theory, B"},{"key":"BF02579383_CR4","doi-asserted-by":"crossref","unstructured":"M. C. Golumbic,Algorithmic Graph Theory and Perfect Graphs, Academic Press, (1980).","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"BF02579383_CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01589348","volume":"20","author":"H. Gr\u00f6flin","year":"1981","unstructured":"H. Gr\u00f6flin andT. M. Liebling, Connected and Alternating Vectors: Polyhedra and Algorithms,Mathematical Programming,20 (1981), 233\u2013244.","journal-title":"Mathematical Programming"},{"key":"BF02579383_CR6","unstructured":"A. J. Hoffman, A. W. J. Kolen andM. Sakarovitch, Totally Balanced and Greedy Matrices,Prepring BW 165\/82,Stiching Mathematisch Centrum, Amsterdam, (1982)."},{"key":"BF02579383_CR7","unstructured":"A. W. J. Kolen, Solving Covering Problems and the Uncapacitated Plant Location Problem on Trees,Preprint BW 163\/82,Stichting Mathematisch Centrum, Amsterdam (1982)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579383.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579383\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:03Z","timestamp":1558197903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["BF02579383"],"URL":"https:\/\/doi.org\/10.1007\/bf02579383","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}