{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:41:32Z","timestamp":1777596092603,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0020-0190(95)00037-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"301-304","source":"Crossref","is-referenced-by-count":4,"title":["On the equivalence covering number of splitgraphs"],"prefix":"10.1016","volume":"54","author":[{"given":"A.","family":"Blokhuis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00037-D_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02579381","article-title":"Covering graphs by the minimum number of equivalence relations","volume":"6","author":"Alon","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(95)00037-D_BIB2","article-title":"Repr\u00e9sentations, noyaux en th\u00e9orie des graphes et hypergraphes","author":"Duchet","year":"1979"},{"key":"10.1016\/0020-0190(95)00037-D_BIB3","series-title":"Edge-colourings of Graphs","author":"Fiorini","year":"1977"},{"key":"10.1016\/0020-0190(95)00037-D_BIB4","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(95)00037-D_BIB5","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(95)00037-D_BIB6","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(95)00037-D_BIB7","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/0095-8956(89)90053-1","article-title":"Clique covers and coloring problems of graphs","volume":"46","author":"Klotz","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(95)00037-D_BIB8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(80)90039-0","article-title":"Complexity of dimension three and some related edge-covering characteristics of graphs","volume":"11","author":"Ku\u010dera","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(95)00037-D_BIB9","first-page":"151","article-title":"Clique covering of chordal graphs","volume":"36","author":"Ma","year":"1989","journal-title":"Utilitas Math."},{"key":"10.1016\/0020-0190(95)00037-D_BIB10","first-page":"157","article-title":"The complexity of the clique partition number problem","volume":"66","author":"Ma","year":"1988"},{"key":"10.1016\/0020-0190(95)00037-D_BIB11","series-title":"Proc. 10th Australian Conf. on Combinatorial Mathematics","article-title":"Clique coverings of graphs \u2014 A survey","author":"Pullman","year":"1982"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500037D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500037D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:58:55Z","timestamp":1555297135000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500037D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["002001909500037D"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00037-d","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}