{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T14:18:22Z","timestamp":1778077102139,"version":"3.51.4"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,7,1]],"date-time":"1981-07-01T00:00:00Z","timestamp":362793600000},"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":11704,"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":[[1981,7]]},"DOI":"10.1016\/0166-218x(81)90013-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"163-174","source":"Crossref","is-referenced-by-count":598,"title":["Complement reducible graphs"],"prefix":"10.1016","volume":"3","author":[{"given":"D.G.","family":"Corneil","sequence":"first","affiliation":[]},{"given":"H.","family":"Lerchs","sequence":"additional","affiliation":[]},{"given":"L.Stewart","family":"Burlingham","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(81)90013-5_BIB1","series-title":"M.Sc. Thesis","article-title":"An investigation of the subgraph isomorphism problem","author":"Agarwal","year":"1980"},{"key":"10.1016\/0166-218X(81)90013-5_BIB2","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0095-8956(76)90033-2","article-title":"A note on a paper by D. Seinsche","volume":"21","author":"Arditti","year":"1976","journal-title":"J. Combinatorial Theory (B)"},{"key":"10.1016\/0166-218X(81)90013-5_BIB3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(81)90013-5_BIB4","series-title":"Problems polynomially equivalent to graph isomorphism","author":"Booth","year":"1979"},{"key":"10.1016\/0166-218X(81)90013-5_BIB5","doi-asserted-by":"crossref","unstructured":"C. Colbourn and M. Colbourn, private communication (1978)","DOI":"10.1145\/1008605.1008608"},{"key":"10.1016\/0166-218X(81)90013-5_BIB6","series-title":"Xeroxed course notes","article-title":"Empirical logic","author":"Foulis","year":"1969"},{"key":"10.1016\/0166-218X(81)90013-5_BIB7","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(81)90013-5_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(81)90013-5_BIB9","series-title":"Complexity of Computer Computations","article-title":"Isomorphism of planar graphs","author":"Hopcroft","year":"1972"},{"key":"10.1016\/0166-218X(81)90013-5_BIB10","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/800119.803896","article-title":"Linear time algorithm for isomorphism of planar graphs","author":"Hopcroft","year":"1974","journal-title":"Proc. Sixth Annual ACM Symp. on the Theory of Computing"},{"issue":"B","key":"10.1016\/0166-218X(81)90013-5_BIB11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","article-title":"On a class of posets and the corresponding comparability graphs","volume":"24","author":"Jung","year":"1978","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0166-218X(81)90013-5_BIB12","article-title":"Isomorphism testing in hookup classes","author":"Klawe","year":"1981","journal-title":"IBM Research Report RJ3091"},{"key":"10.1016\/0166-218X(81)90013-5_BIB13","first-page":"3","article-title":"Graphical algorithms and their complexity","volume":"81","author":"Lawler","year":"1976","journal-title":"Math. Centre Tracts"},{"key":"10.1016\/0166-218X(81)90013-5_BIB14","series-title":"On cliques and kernels","author":"Lerchs","year":"1971"},{"key":"10.1016\/0166-218X(81)90013-5_BIB15","series-title":"On the clique-kernel structure of graphs","author":"Lerchs","year":"1972"},{"issue":"2","key":"10.1016\/0166-218X(81)90013-5_BIB16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322123.322125","article-title":"A linear time algorithm for deciding interval graph isomorphism","volume":"26","author":"Leuker","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(81)90013-5_BIB17","first-page":"601","article-title":"The combination of resistances","volume":"28","author":"MacMahon","year":"1892","journal-title":"The Electrician"},{"key":"10.1016\/0166-218X(81)90013-5_BIB18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","article-title":"On cliques in graphs","volume":"3","author":"Moon","year":"1965","journal-title":"Israel J. Math."},{"key":"10.1016\/0166-218X(81)90013-5_BIB19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(90)90286-Q","article-title":"A class of threshold and domishold graphs: equistable and equidominating graphs","volume":"29","author":"Payan","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(81)90013-5_BIB20","first-page":"139","article-title":"An Introduction to Combinatorial Analysis","author":"Riordan","year":"1958"},{"key":"10.1016\/0166-218X(81)90013-5_BIB21","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. Combinatorial Theory (B)"},{"key":"10.1016\/0166-218X(81)90013-5_BIB22","series-title":"M.Sc. Thesis","article-title":"Cographs, a class of tree representable graphs","author":"Stewart","year":"1978"},{"issue":"4","key":"10.1016\/0166-218X(81)90013-5_BIB23","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1017\/S1446788700029232","article-title":"Dacey graphs","volume":"18","author":"Sumner","year":"1974","journal-title":"J. Australian Math. Soc."},{"key":"10.1016\/0166-218X(81)90013-5_BIB24","first-page":"1","article-title":"The recognition of series parallel digraphs","author":"Valdes","year":"1979","journal-title":"Proc. Eleventh Annual ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0166-218X(81)90013-5_BIB25","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1090\/S0002-9939-1962-0172273-0","article-title":"The comparability graph of a tree","volume":"13","author":"Wolk","year":"1962","journal-title":"Proc. AMS"},{"key":"10.1016\/0166-218X(81)90013-5_BIB26","first-page":"17","article-title":"A note on \u2018The comparability graph of a tree\u2019","volume":"16","author":"Wolk","year":"1965","journal-title":"Proc. AMS"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900135?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900135?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:25:03Z","timestamp":1555136703000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X81900135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,7]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,7]]}},"alternative-id":["0166218X81900135"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(81)90013-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1981,7]]}}}