{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:31:22Z","timestamp":1780381882811,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"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":13346,"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":[[1977]]},"DOI":"10.1016\/0012-365x(77)90030-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"159-165","source":"Crossref","is-referenced-by-count":37,"title":["Algorithms on clique separable graphs"],"prefix":"10.1016","volume":"19","author":[{"given":"F\u01cenic\u01ce","family":"Gavril","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(77)90030-9_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(77)90030-9_BIB2","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\/0012-365X(77)90030-9_BIB3","first-page":"3","article-title":"Graphen mit trianguleirbaren ungeraden Vielecken","volume":"7","author":"Gallai","year":"1962","journal-title":"Magyar Tud. Akad. Mat. Kutato Int. K\u00f6zl."},{"key":"10.1016\/0012-365X(77)90030-9_BIB4","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, 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\/0012-365X(77)90030-9_BIB5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"23","author":"Pnueli","year":"1971","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(77)90030-9_BIB6","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0012-365X(77)90030-9_BIB7","first-page":"345","article-title":"The covering of graphs by cliques","volume":"3","author":"Suranyi","year":"1968","journal-title":"Studia Sc. Math. Hung."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77900309?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77900309?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T10:58:19Z","timestamp":1555153099000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X77900309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977]]}},"alternative-id":["0012365X77900309"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(77)90030-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1977]]}}}