{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:47:23Z","timestamp":1649004443736},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,2,27]],"date-time":"2010-02-27T00:00:00Z","timestamp":1267228800000},"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":[[2010,3]]},"DOI":"10.1007\/s00373-010-0906-0","type":"journal-article","created":{"date-parts":[[2010,2,26]],"date-time":"2010-02-26T00:46:51Z","timestamp":1267145211000},"page":"243-257","source":"Crossref","is-referenced-by-count":1,"title":["Induced Graph Packing Problems"],"prefix":"10.1007","volume":"26","author":[{"given":"Zolt\u00e1n","family":"Kir\u00e1ly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1cint","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,27]]},"reference":[{"key":"906_CR1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0095-8956(86)90085-7","volume":"40","author":"G. Cornu\u00e9jols","year":"1986","unstructured":"Cornu\u00e9jols G., Hartvigsen D.: An extension of matching theory. J. Combin. Theory Ser. B 40, 285\u2013296 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"key":"906_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(82)90016-5","volume":"1","author":"G. Cornu\u00e9jols","year":"1981\/82","unstructured":"Cornu\u00e9jols G., Hartvigsen D., Pulleyblank W.: Packing subgraphs in a graph. Oper. Res. Lett. 1, 139\u2013143 (1981\/82)","journal-title":"Oper. Res. Lett."},{"key":"906_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120901","volume":"13","author":"G. Cornu\u00e9jols","year":"1980","unstructured":"Cornu\u00e9jols G., Pulleyblank W.: Perfect triangle-free 2-matchings. Math. Prog. Study 13, 1\u20137 (1980)","journal-title":"Math. Prog. Study"},{"key":"906_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"906_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.6028\/jres.069B.016","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J., Fulkerson D.R.: Transversals and matroid partition. J. Res. Nat. Bur. Stand. Sect. B 69, 147\u2013153 (1965)","journal-title":"J. Res. Nat. Bur. Stand. Sect. B"},{"key":"906_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<185::AID-JGT2>3.0.CO;2-H","volume":"25","author":"Y. Egawa","year":"1997","unstructured":"Egawa Y., Kano M., Kelmans A.K.: Star partitions of graphs. J. Graph Theory 25, 185\u2013190 (1997)","journal-title":"J. Graph Theory"},{"key":"906_CR7","first-page":"135","volume":"8","author":"T. Gallai","year":"1963","unstructured":"Gallai T.: Kritische Graphen II. A Magy. Tud. Akad. Mat. Kut. Int. K\u00f6zl. 8, 135\u2013139 (1963)","journal-title":"A Magy. Tud. Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"906_CR8","first-page":"401","volume":"9","author":"T. Gallai","year":"1964","unstructured":"Gallai T.: Maximale Systeme unabh\u00e4ngiger Kanten. A Magy. Tud. Akad. Mat. Kut. Int. K\u00f6zl. 9, 401\u2013413 (1964)","journal-title":"A Magy. Tud. Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"906_CR9","first-page":"455","volume":"63","author":"A.J. Hoffman","year":"1956","unstructured":"Hoffman A.J., Kuhn H.W.: Systems of distinct representatives and linear programming. Am. Math. Mon. 63, 455\u2013460 (1956)","journal-title":"Am. Math. Mon."},{"key":"906_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0012-365X(96)00121-5","volume":"173","author":"A.K. Kelmans","year":"1997","unstructured":"Kelmans A.K.: Optimal packing of induced stars in a graph. Discrete Math. 173, 97\u2013127 (1997)","journal-title":"Discrete Math."},{"key":"906_CR11","unstructured":"Kir\u00e1ly, Z., Szab\u00f3, J.: Generalized induced factor problems. Technical Report TR-2002-07. Egerv\u00e1ry Research Group, Budapest. http:\/\/www.cs.elte.hu\/egres (2002)"},{"key":"906_CR12","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"D.G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick D.G., Hell P.: On the complexity of general graph factor problems. SIAM J. Comput. 12, 601\u2013609 (1983)","journal-title":"SIAM J. Comput."},{"key":"906_CR13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(78)90006-7","volume":"23","author":"M. Las Vergnas","year":"1978","unstructured":"Las Vergnas M.: An extension of Tutte\u2019s 1-factor theorem. Discrete Math. 23, 241\u2013255 (1978)","journal-title":"Discrete Math."},{"key":"906_CR14","unstructured":"Loebl M., Poljak S.: Efficient subgraph packing. KAM-DIMATIA Series 1987-50"},{"key":"906_CR15","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/0095-8956(88)90042-1","volume":"44","author":"M. Loebl","year":"1988","unstructured":"Loebl M., Poljak S.: On matroids induced by packing subgraphs. J. Combin. Theory Ser. B 44, 338\u2013354 (1988)","journal-title":"J. Combin. Theory Ser. B"},{"key":"906_CR16","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1006\/jctb.1993.1058","volume":"59","author":"M. Loebl","year":"1993","unstructured":"Loebl M., Poljak S.: Efficient subgraph packing. J. Combin. Theory Ser. B 59, 106\u2013121 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"key":"906_CR17","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","volume":"8","author":"L. Lov\u00e1sz","year":"1970","unstructured":"Lov\u00e1sz L.: Subgraphs with prescribed valencies. J. Combin. Theory 8, 391\u2013416 (1970)","journal-title":"J. Combin. Theory"},{"key":"906_CR18","doi-asserted-by":"crossref","first-page":"230","DOI":"10.4153\/CJM-1958-027-8","volume":"10","author":"N.S. Mendelsohn","year":"1958","unstructured":"Mendelsohn N.S., Dulmage A.L.: Some generalizations of the problem of distinct representatives. Can. J. Math. 10, 230\u2013241 (1958)","journal-title":"Can. J. Math."},{"key":"906_CR19","first-page":"3","volume":"36","author":"A. Saito","year":"1993","unstructured":"Saito A., Watanabe M.: Partitioning graphs into induced stars. Ars Combin. 36, 3\u20136 (1993)","journal-title":"Ars Combin."},{"key":"906_CR20","volume-title":"Combinatorial Optimization. Polyhedra and Efficiency Algorithms and Combinatorics, vol. 24","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A.: Combinatorial Optimization. Polyhedra and Efficiency Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)"},{"key":"906_CR21","unstructured":"Szab\u00f3, J.: Graph packings and the degree prescribed factor problem. PhD thesis, E\u00f6tv\u00f6s University, Budapest. http:\/\/www.cs.elte.hu\/~jacint (2006)"},{"key":"906_CR22","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W.T. Tutte","year":"1952","unstructured":"Tutte W.T.: The factors of graphs. Can. J. Math. 4, 314\u2013328 (1952)","journal-title":"Can. J. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0906-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0906-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0906-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:30Z","timestamp":1559055510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0906-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,27]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["906"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0906-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,27]]}}}