{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:27:48Z","timestamp":1754195268736},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":7017,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0166-218x(92)00153-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"135-148","source":"Crossref","is-referenced-by-count":6,"title":["Edge-disjoint packings of graphs"],"prefix":"10.1016","volume":"50","author":[{"given":"Derek G.","family":"Corneil","sequence":"first","affiliation":[]},{"given":"Shigeru","family":"Masuyama","sequence":"additional","affiliation":[]},{"given":"S.","family":"Louis Hakimi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)00153-D_BIB1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01956769","article-title":"A note on the decomposition of graphs into isomorphic matchings","volume":"42","author":"Alon","year":"1983","journal-title":"Acta Math. Hungar."},{"key":"10.1016\/0166-218X(92)00153-D_BIB2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0885-064X(91)90006-J","article-title":"NP-completeness of graph decomposition problems","volume":"7","author":"Cohen","year":"1991","journal-title":"J. Complexity"},{"key":"10.1016\/0166-218X(92)00153-D_BIB3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(85)90027-7","article-title":"The complexity of generalized clique packing","volume":"12","author":"Corneil","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)00153-D_BIB4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(92)00153-D_BIB5","first-page":"125","article-title":"Decomposition of graphs into graphs with three edges","volume":"20","author":"Favaron","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(92)00153-D_BIB6","series-title":"Ph.D. Dissertation","article-title":"The complexity of graph theory problems","author":"Holyer","year":"1980"},{"key":"10.1016\/0166-218X(92)00153-D_BIB7","first-page":"713","article-title":"The NP-completeness of some edge-partition problems","volume":"7","author":"Holyer","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)00153-D_BIB8","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(92)00153-D_BIB9","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","article-title":"On the complexity of general graph factor problems","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)00153-D_BIB10","series-title":"KAM Series 89-599","article-title":"Subgraph packing\u2014a survey","author":"Loebl","year":"1989"},{"key":"10.1016\/0166-218X(92)00153-D_BIB11","article-title":"Matching Theory","volume":"29","author":"Lovasz","year":"1984"},{"key":"10.1016\/0166-218X(92)00153-D_BIB12","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1007\/BF01759074","article-title":"Chain packing in graphs","volume":"6","author":"Masuyama","year":"1991","journal-title":"Algoithmica"},{"issue":"3","key":"10.1016\/0166-218X(92)00153-D_BIB13","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/0166-218X(92)00153-D_BIB14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200153D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200153D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:27:16Z","timestamp":1555136836000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9200153D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0166218X9200153D"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)00153-d","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}