{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:01Z","timestamp":1759335781232},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"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":8417,"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":[[1990,7]]},"DOI":"10.1016\/0012-365x(90)90220-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"49-62","source":"Crossref","is-referenced-by-count":5,"title":["On the number of distinct minimal clique partitions and clique covers of a line graph"],"prefix":"10.1016","volume":"83","author":[{"given":"Sean","family":"McGuinness","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Rees","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90220-C_BIB1","first-page":"421","article-title":"On a combinatorial problem","volume":"10","author":"de Bruijn","year":"1948","journal-title":"Indag. Math."},{"key":"10.1016\/0012-365X(90)90220-C_BIB2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(86)90173-1","article-title":"Clique partitions of the cocktail party graph","volume":"59","author":"Gregory","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90220-C_BIB3","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","article-title":"Contentment in graph theory: covering graphs with cliques","volume":"39","author":"Orlin","year":"1977","journal-title":"Indag. Math."},{"key":"10.1016\/0012-365X(90)90220-C_BIB4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090220C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090220C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:54:21Z","timestamp":1555134861000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090220C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["0012365X9090220C"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90220-c","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}