{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:28:56Z","timestamp":1773944936865,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"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":[[1996,8]]},"DOI":"10.1016\/0166-218x(96)00094-7","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:52:26Z","timestamp":1053348746000},"page":"247-255","source":"Crossref","is-referenced-by-count":68,"title":["Quasi-threshold graphs"],"prefix":"10.1016","volume":"69","author":[{"given":"Yan","family":"Jing-Ho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Jer-Jeong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(96)00094-7_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(96)00094-7_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithm","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput System. Sci."},{"key":"10.1016\/0166-218X(96)00094-7_BIB3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","article-title":"The bandwidth problem for graphs and matrices \u2014 a survey","volume":"6","author":"Chinn","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(96)00094-7_BIB4","article-title":"Set-packing and threshold graphs","author":"Chv\u00e1tal","year":"1973"},{"key":"10.1016\/0166-218X(96)00094-7_BIB5","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":"Discrete. Appl. Math."},{"key":"10.1016\/0166-218X(96)00094-7_BIB6","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(96)00094-7_BIB7","first-page":"67","article-title":"Classical perfect graphs","volume":"21","author":"Duchet","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(96)00094-7_BIB8","first-page":"133","article-title":"\u00dcber extreme punkt- und kantenmengen","volume":"2","author":"Gallai","year":"1959","journal-title":"Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math."},{"key":"10.1016\/0166-218X(96)00094-7_BIB9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(78)90178-4","article-title":"Trivially perfect graphs","volume":"24","author":"Golumbic","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(96)00094-7_BIB10","article-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(96)00094-7_BIB11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-56402-0_31","article-title":"A simple test for interval graphs","volume":"657","author":"Hsu","year":"1992","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0166-218X(96)00094-7_BIB12","first-page":"105","article-title":"Optimization problems on quasi-threshold graphs","volume":"14","author":"Ma","year":"1989","journal-title":"J. Combin. Inform. System. Sci."},{"key":"10.1016\/0166-218X(96)00094-7_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(96)00094-7_BIB14","first-page":"789","article-title":"The comparability graph of a tree","volume":"3","author":"Wolk","year":"1962"},{"key":"10.1016\/0166-218X(96)00094-7_BIB15","first-page":"17","article-title":"A note on the comparability graph of a tree","volume":"16","author":"Wolk","year":"1965"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X96000947?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X96000947?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T07:56:54Z","timestamp":1556179014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X96000947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0166218X96000947"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(96)00094-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}