{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:12:51Z","timestamp":1773079971953,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"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":6833,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0166-218x(94)90004-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"133-143","source":"Crossref","is-referenced-by-count":39,"title":["Efficient algorithms for minimum weighted colouring of some classes of perfect graphs"],"prefix":"10.1016","volume":"55","author":[{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90004-3_BIB1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0220012","article-title":"Minimum weighted colouring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbirary graphs","volume":"20","author":"Balas","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)90004-3_BIB2","year":"1984"},{"key":"10.1016\/0166-218X(94)90004-3_BIB3","first-page":"57","article-title":"Strongly perfect graphs","author":"Berge","year":"1984"},{"key":"10.1016\/0166-218X(94)90004-3_BIB4","first-page":"63","article-title":"Perfectly ordered graphs","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0166-218X(94)90004-3_BIB5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0166-218X(94)90004-3_BIB6","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","article-title":"Anti-blocking polyhedra","volume":"12","author":"Fulkerson","year":"1972","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0166-218X(94)90004-3_BIB7","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum colouring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)90004-3_BIB8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(77)90030-9","article-title":"Algorithms on clique separable graphs","volume":"19","author":"Gavril","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90004-3_BIB9","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(94)90004-3_BIB10","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-0208(08)72942-6","article-title":"Algorithmic aspects of perfect graphs","author":"Golumbic","year":"1984"},{"key":"10.1016\/0166-218X(94)90004-3_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-0208(08)72943-8","article-title":"Polynomial algorithms for perfect graphs","author":"Grotschel","year":"1984"},{"key":"10.1016\/0166-218X(94)90004-3_BIB12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(90)90251-C","article-title":"On the complexity of recognizing perfectly orderable graphs","volume":"80","author":"Middendorf","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90004-3_BIB13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/0166-218X(94)90004-3_BIB14","first-page":"216","article-title":"The complexity of the satisfiability problem","author":"Schaefer","year":"1978","journal-title":"Proceedings 10th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(94)90004-3_BIB15","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","article-title":"On comparability graphs and permutation graphs","volume":"14","author":"Spinrad","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)90004-3_BIB16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","article-title":"Decomposition by clique separators","volume":"55","author":"Tarjan","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90004-3_BIB17","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)90004-3_BIB18","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-0208(08)72941-4","article-title":"A method for solving certain graph recognition and optimization problems, with applications to perfect graphs","author":"Whitesides","year":"1984"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900043?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900043?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:29:45Z","timestamp":1555122585000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0166218X94900043"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90004-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}