{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:09Z","timestamp":1759638609356},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":8082,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0885-064x(91)90006-j","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:41:18Z","timestamp":1094654478000},"page":"200-212","source":"Crossref","is-referenced-by-count":34,"title":["NP-Completeness of graph decomposition problems"],"prefix":"10.1016","volume":"7","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Tarsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(91)90006-J_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\/0885-064X(91)90006-J_BIB2","series-title":"Proceedings of the 5th British Combinatorial Conference","first-page":"53","article-title":"Graph decomposition and G-designs","author":"Bermond","year":"1975"},{"key":"10.1016\/0885-064X(91)90006-J_BIB3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01903577","article-title":"3K2-decomposition of a graph","volume":"40","author":"Bialostocki","year":"1982","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0885-064X(91)90006-J_BIB4","series-title":"Stitching mathematisch centrum (zn 97\/80)","article-title":"The Decomposition of Graphs into Ladder Graphs","author":"Brouwer","year":"1980"},{"key":"10.1016\/0885-064X(91)90006-J_BIB5","series-title":"M.Sc Thesis","article-title":"Decomposition and Partition of Trees into Isomorphic Subtrees","author":"Caro","year":"1985"},{"key":"10.1016\/0885-064X(91)90006-J_BIB6","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\/0885-064X(91)90006-J_BIB7","series-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0885-064X(91)90006-J_BIB8","series-title":"Ph.D. dissertation","article-title":"The Complexity of Graph Theory Problems","author":"Holyer","year":"1980"},{"key":"10.1016\/0885-064X(91)90006-J_BIB9","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","article-title":"The NP-completeness of some edge partition problems","volume":"10","author":"Holyer","year":"1981","journal-title":"Siam J. Comput."},{"key":"10.1016\/0885-064X(91)90006-J_BIB10","series-title":"10th Annual ACM Symposium on Theory of Computing Machinery","article-title":"On the completeness of a generalized matching problem","author":"Kirkpatric","year":"1978"},{"key":"10.1016\/0885-064X(91)90006-J_BIB11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1515\/crll.1853.45.181","article-title":"Combinatorische aufgabe","volume":"45","author":"Steiner","year":"1853","journal-title":"Z. Reine Angew. Math."},{"key":"10.1016\/0885-064X(91)90006-J_BIB12","first-page":"647","article-title":"Decomposition of a complete graph into subgraphs isomorphic to a given graph","author":"Wilson","year":"1976","journal-title":"Utilitas Math."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9190006J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9190006J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T20:57:45Z","timestamp":1549227465000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X9190006J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["0885064X9190006J"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(91)90006-j","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}