{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T11:53:22Z","timestamp":1768478002660,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":[[1989,5]]},"DOI":"10.1016\/0020-0190(89)90221-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"135-138","source":"Crossref","is-referenced-by-count":58,"title":["Achromatic number is NP-complete for cographs and interval graphs"],"prefix":"10.1016","volume":"31","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90221-4_BIB1","series-title":"Proc. 15th ICALP","first-page":"38","article-title":"Problems easy for tree-decomposable graphs","volume":"Vol. 317","author":"Arnborg","year":"1988"},{"key":"10.1016\/0020-0190(89)90221-4_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(86)90112-2","article-title":"Total domination in interval graphs","volume":"23","author":"Bertossi","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90221-4_BIB3","series-title":"Technical Report RUU-CS-87-12","article-title":"The Maximum Cut and Minimum Cut Into Bounded Sets Problems on Cographs","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0020-0190(89)90221-4_BIB4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Disc. Applied Math."},{"key":"10.1016\/0020-0190(89)90221-4_BIB5","series-title":"Computers and Intractibility, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(89)90221-4_BIB6","series-title":"Algorithm Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(89)90221-4_BIB7","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0020-0190(89)90221-4_BIB8","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(89)90221-4_BIB9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","article-title":"Finding Hamiltonian circuits in interval graphs","volume":"20","author":"Keil","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90221-4_BIB10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(86)90022-0","article-title":"Total domination in interval graphs","volume":"22","author":"Keil","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90221-4_BIB11","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/0890-5401(87)90028-9","article-title":"Finding the minimum bandwidth of an interval graph","volume":"74","author":"Kratsch","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(89)90221-4_BIB12","series-title":"Graphs and Order","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"Moehring","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902214?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902214?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:56:12Z","timestamp":1555088172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089902214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0020019089902214"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90221-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}