{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:45:34Z","timestamp":1761806734707},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":[[1998,3]]},"DOI":"10.1016\/s0020-0190(98)00019-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"301-303","source":"Crossref","is-referenced-by-count":25,"title":["Maximum h-colourable subgraph problem in balanced graphs"],"prefix":"10.1016","volume":"65","author":[{"given":"Elias","family":"Dahlhaus","sequence":"first","affiliation":[]},{"given":"Paul D.","family":"Manuel","sequence":"additional","affiliation":[]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00019-2_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0020-0190(98)00019-2_BIB2","first-page":"103","article-title":"Algorithmic aspects of the generalized clique transversal problem on chordal graphs","volume":"621","author":"Chang","year":"1996"},{"key":"10.1016\/S0020-0190(98)00019-2_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(88)90086-8","article-title":"The complexity of generalized clique covering","volume":"22","author":"Corneil","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(98)00019-2_BIB4","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/BFb0121244","volume":"1","author":"Fulkerson","year":"1974","journal-title":"On balanced matrices, Math. Programming Study"},{"key":"10.1016\/S0020-0190(98)00019-2_BIB5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(92)90116-R","article-title":"Generalized vertex covering in interval graphs","volume":"39","author":"Marathe","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0020-0190(98)00019-2_BIB6","first-page":"216","article-title":"Hereditarily clique Helly graphs","volume":"14","author":"Prisner","year":"1993","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0020-0190(98)00019-2_BIB7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","article-title":"The maximum k-colourable subgraph problem for chordal graphs","volume":"24","author":"Yannakakis","year":"1987","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000192?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000192?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T22:21:31Z","timestamp":1556144491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020019098000192"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00019-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}