{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T17:36:26Z","timestamp":1768325786988,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5829,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0012-365x(96)00121-5","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"97-127","source":"Crossref","is-referenced-by-count":17,"title":["Optimal packing of induced stars in a graph"],"prefix":"10.1016","volume":"173","author":[{"given":"Alexander K.","family":"Kelmans","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00121-5_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(82)90048-6","article-title":"Factors with given components","volume":"42","author":"Amahashi","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00121-5_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(96)00121-5_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0095-8956(86)90085-7","article-title":"An extension of matching theory","volume":"40","author":"Cornu\u00e9jols","year":"1986","journal-title":"J. Combin. Theory Ser B"},{"key":"10.1016\/S0012-365X(96)00121-5_BIB4","article-title":"Star factors and star packings","author":"Hell","year":"1982"},{"key":"10.1016\/S0012-365X(96)00121-5_BIB5","first-page":"601","article-title":"On the complexity of general graph factor problems","author":"Hell","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(96)00121-5_BIB6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/0607024","article-title":"Packing by complete bipartite graphs","volume":"7","author":"Hell","year":"1986","journal-title":"SIAM J. Algebraic Discrete Math."},{"key":"10.1016\/S0012-365X(96)00121-5_BIB7","series-title":"Matroids and combinatorial optimization problems","author":"Kelmans","year":"1989"},{"issue":"3","key":"10.1016\/S0012-365X(96)00121-5_BIB8","first-page":"94","article-title":"On the minimal covering in a matroid","volume":"12","author":"Kelmans","year":"1976","journal-title":"Problemi peredachi informacii"},{"key":"10.1016\/S0012-365X(96)00121-5_BIB9_1","series-title":"Issled. po prikladnoy teorii grafov","first-page":"140","article-title":"Extremal sets and covering and packing problems in a matroid","author":"Kelmans","year":"1986"},{"issue":"2","key":"10.1016\/S0012-365X(96)00121-5_BIB9_2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1090\/trans2\/158\/14","volume":"158","author":"Kelmans","year":"1994","journal-title":"Amer. Math. Soc. Transl."},{"key":"10.1016\/S0012-365X(96)00121-5_BIB10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(78)90006-7","article-title":"An extension of Tutte's 1-factor theorem","volume":"23","author":"Las Vergnas","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00121-5_BIB11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/0095-8956(88)90042-1","article-title":"On matroids induced by packing subgraphs","volume":"44","author":"Loebl","year":"1988","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00121-5_BIB12","series-title":"Topics in Combinatorucs and Graph Theory: Essays in Honour of Gerhard Ringel","first-page":"491","article-title":"Subgraph packing \u2014 A survey","author":"Loebl","year":"1990"},{"key":"10.1016\/S0012-365X(96)00121-5_BIB13","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1006\/jctb.1993.1058","article-title":"Efficient subgraph packing","volume":"59","author":"Loebl","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00121-5_BIB14","series-title":"Matching Theory","author":"Lovasz","year":"1986"},{"key":"10.1016\/S0012-365X(96)00121-5_BIB15","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001215?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001215?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:50Z","timestamp":1556130530000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96001215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0012365X96001215"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00121-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}