{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T02:19:57Z","timestamp":1775355597951,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"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":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90131-u","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"85-99","source":"Crossref","is-referenced-by-count":129,"title":["Completely separable graphs"],"prefix":"10.1016","volume":"27","author":[{"given":"Peter L.","family":"Hammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Maffray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90131-U_BIB1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(90)90131-U_BIB2","first-page":"114","volume":"10","author":"Berge","year":"1961"},{"key":"10.1016\/0166-218X(90)90131-U_BIB3","series-title":"Topics on Perfect Graphs","first-page":"221","article-title":"A composition for perfect graphs","volume":"21","author":"Bixby","year":"1984"},{"key":"10.1016\/0166-218X(90)90131-U_BIB4","series-title":"Bonn Workshop on Combinatorial Optimization","first-page":"1","article-title":"Parity graphs","volume":"16","author":"Burlet","year":"1982"},{"key":"10.1016\/0166-218X(90)90131-U_BIB5","first-page":"63","article-title":"Perfectly orderable graphs","volume":"21","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0166-218X(90)90131-U_BIB6","first-page":"145","article-title":"Aggregations of inequalities, in: Integer Programming","volume":"1","author":"Chv\u00e1tal","year":"1977"},{"key":"10.1016\/0166-218X(90)90131-U_BIB7","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90131-U_BIB8","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","article-title":"A combinatorial decomposition theory","volume":"22","author":"Cunningham","year":"1980","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(90)90131-U_BIB9","unstructured":"C.P. Gabor, W.L. Hsu and K.J. Supowit, Recognizing circle graphs in polynomial time, Manuscript."},{"key":"10.1016\/0166-218X(90)90131-U_BIB10","series-title":"PhD Thesis","author":"Ho\u00e0ng","year":"1985"},{"key":"10.1016\/0166-218X(90)90131-U_BIB11","series-title":"Tech. Rept.","article-title":"A class of brittle graphs","author":"Ho\u00e0ng","year":"1986"},{"key":"10.1016\/0166-218X(90)90131-U_BIB12","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","article-title":"A. characterization of distance-hereditary graphs","volume":"28","author":"Howorka","year":"1977","journal-title":"Quart. J. Math."},{"key":"10.1016\/0166-218X(90)90131-U_BIB13","first-page":"115","article-title":"\u00dcber die \u00dcberdeckung von Graphen mit Cliquen","volume":"15","author":"Olaru","year":"1969","journal-title":"Wiss. Z. Tech. Hochsch. Ilmenau"},{"key":"10.1016\/0166-218X(90)90131-U_BIB14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","article-title":"On a property of the class of n-colorable graphs","volume":"16","author":"Seinsche","year":"1974","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090131U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090131U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:55Z","timestamp":1555120615000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090131U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X9090131U"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90131-u","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}