{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T05:30:57Z","timestamp":1773293457389,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T00:00:00Z","timestamp":1222819200000},"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":[[2008,10]]},"DOI":"10.1007\/s00373-008-0804-x","type":"journal-article","created":{"date-parts":[[2008,10,25]],"date-time":"2008-10-25T05:24:20Z","timestamp":1224912260000},"page":"485-494","source":"Crossref","is-referenced-by-count":2,"title":["Packing Trees with Constraints on the Leaf Degree"],"prefix":"10.1007","volume":"24","author":[{"given":"J\u00e1cint","family":"Szab\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,26]]},"reference":[{"key":"804_CR1","unstructured":"Cornu\u00e9jols, G., Hartvigsen, D.: An extension of matching theory. J. Combin. Theory Ser. B 40, 285\u2013296 (1986)"},{"key":"804_CR2","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Hartvigsen, D., Pulleyblank, W.: Packing subgraphs in a graph. Oper. Res. Letter 1, 139\u2013143 (1981\/82)","DOI":"10.1016\/0167-6377(82)90016-5"},{"key":"804_CR3","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian J. of Math. 17, 449\u2013467 (1965)"},{"key":"804_CR4","unstructured":"Gallai, T.: Kritische Graphen II. A Magyar Tud. Akad. \u2013 Mat. Kut. Int. K\u00f6zl. 8, 135\u2013139 (1963)"},{"key":"804_CR5","unstructured":"Gallai, T.: Maximale Systeme unabh\u00e4ngiger Kanten. A Magyar Tud. Akad. \u2013 Mat. Kut. Int. K\u00f6zl. 9, 401\u2013413 (1964)"},{"key":"804_CR6","doi-asserted-by":"crossref","unstructured":"Hartvigsen, D., Hell, P., Szab\u00f3, J.: The k-piece packing problem. J. Graph Theory 52, 267\u2013293 (2006)","DOI":"10.1002\/jgt.20161"},{"key":"804_CR7","unstructured":"Kaneko, A.: Spanning trees with constraints on the leaf degree. Discrete Appl. Math. 115, 73\u201376 (2001)"},{"key":"804_CR8","unstructured":"Kaneko A.: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Combin. Theory Ser. B 88, 195\u2013218 (2003)"},{"key":"804_CR9","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L.: A generalization of K\u0151nig\u2019s theorem. Acta Math. Acad. Sci. Hungar. 21, 443\u2013446 (1970)","DOI":"10.1007\/BF01894789"},{"key":"804_CR10","unstructured":"Lov\u00e1sz L.: A note on factor-critical graphs. Studia Sci. Math. Hungar. 7, 279\u2013280 (1972)"},{"key":"804_CR11","unstructured":"Schrijver A.: Combinatorial optimization. Polyhedra and efficiency. Algorithms and Combinatorics 24, Springer-Verlag, Berlin, 2003"},{"key":"804_CR12","unstructured":"Szab\u00f3 J.: Graph packings and the degree prescribed factor problem. PhD thesis, E\u00f6tv\u00f6s University, Budapest, 2006. ( www.cs.elte.hu\/~jacint )"},{"key":"804_CR13","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: The factors of graphs. Canadian J. Math. 4, 314\u2013328, (1952)","DOI":"10.4153\/CJM-1952-028-2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0804-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0804-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0804-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0804-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["804"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0804-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}