{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:50:54Z","timestamp":1649040654064},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":5586,"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":[[1998,4]]},"DOI":"10.1016\/s0012-365x(97)00181-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"41-49","source":"Crossref","is-referenced-by-count":3,"title":["Clique and anticlique partitions of graphs"],"prefix":"10.1016","volume":"185","author":[{"given":"Krzysztof","family":"Bry\u015b","sequence":"first","affiliation":[]},{"given":"Zbigniew","family":"Lonc","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00181-7_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. Acad. Sci. Hung."},{"key":"10.1016\/S0012-365X(97)00181-7_BIB2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0885-064X(91)90006-J","article-title":"NP-completeness of graph decomposition problem","volume":"7","author":"Cohen","year":"1991","journal-title":"J. Complexity"},{"key":"10.1016\/S0012-365X(97)00181-7_BIB3","series-title":"Computers and Intractability, A guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(97)00181-7_BIB4","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\/S0012-365X(97)00181-7_BIB5","series-title":"Graph-theoretic Concepts in Computer Science","first-page":"97","article-title":"On complexity of some chain and antichain partition problem","volume":"vol. 570","author":"Lonc","year":"1992"},{"key":"10.1016\/S0012-365X(97)00181-7_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0012-365X(96)00054-4","article-title":"Delta-system decompositions of graphs","volume":"164","author":"Lone","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00181-7_BIB7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00582740","article-title":"Decomposition of large uniform hypergraphs","volume":"1","author":"Lonc","year":"1985","journal-title":"Order"},{"key":"10.1016\/S0012-365X(97)00181-7_BIB8","first-page":"583","article-title":"Problem 9.10","author":"M\u00f6hring","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001817?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001817?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:29:20Z","timestamp":1556396960000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97001817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0012365X97001817"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00181-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}