{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:29Z","timestamp":1759063409752},"reference-count":22,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":5707,"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":[[1997,12]]},"DOI":"10.1016\/s0012-365x(96)00358-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"83-97","source":"Crossref","is-referenced-by-count":11,"title":["On the closure of graphs under substitution"],"prefix":"10.1016","volume":"177","author":[{"given":"Vassilis","family":"Giakoumakis","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00358-5_BIB1","series-title":"Disc. Applied Math.","article-title":"On Minimal Imperfect Graphs without Induced P5","author":"Barr\u00e9","year":"1996"},{"key":"10.1016\/S0012-365X(96)00358-5_BIB2","first-page":"114","article-title":"F\u00e4rbung von Graphen deren s\u00e4mtliche bzw. deren ungerade Kreise starrsind","volume":"10","author":"Berge","year":"1961","journal-title":"Wiss. Z. MartinLuther-Univ. Halle- Wittenberg Math.-Natur. Reihe"},{"key":"10.1016\/S0012-365X(96)00358-5_BIB3","series-title":"Comm. 13e Assemblee generale de l'URSI","article-title":"Sur une conjecture relative au probleme des codex optimaux","author":"Berge","year":"1962"},{"issue":"1","key":"10.1016\/S0012-365X(96)00358-5_BIB4","first-page":"5","article-title":"The history of perfect graphs","volume":"20","author":"Berge","year":"1996","journal-title":"SEA Bull. Math."},{"key":"10.1016\/S0012-365X(96)00358-5_BIB5","series-title":"Graph Theory with Applications","author":"Bondy","year":"1979"},{"key":"10.1016\/S0012-365X(96)00358-5_BIB6","series-title":"Topics of Perfect Graphs","first-page":"63","article-title":"Perfectly ordered graphs","author":"Chv\u00e1tal","year":"1984"},{"issue":"4","key":"10.1016\/S0012-365X(96)00358-5_BIB7","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/jgt.3190110405","article-title":"Four classes of perfectly orderable graphs","volume":"11","author":"Chv\u00e1tal","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00358-5_BIB8","first-page":"68","article-title":"A New Linear Algorithm for Modular Decomposition","volume":"vol. 787","author":"Cournier","year":"1994"},{"key":"10.1016\/S0012-365X(96)00358-5_BIB9","series-title":"Thesis","article-title":"A combinatorial decomposition theory","author":"Cunningham","year":"1973"},{"key":"10.1016\/S0012-365X(96)00358-5_BIB10","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","article-title":"Decomposition of directed graphs","volume":"3","author":"Cunningham","year":"1982","journal-title":"SIAM J. Algebraic Discrete Math."},{"key":"10.1016\/S0012-365X(96)00358-5_BIB11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(94)90373-5","article-title":"New classes of Berge perfect graphs","volume":"131","author":"De Simone","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00358-5_BIB12","first-page":"77","article-title":"On the dimension of partially ordered sets","volume":"1","author":"Hiragushi","year":"1951","journal-title":"Sci. Rep. Kanazawa Univ."},{"issue":"1","key":"10.1016\/S0012-365X(96)00358-5_BIB13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/sapm198981133","article-title":"On a class of P5-free Graphs","volume":"81","author":"Jamison","year":"1989","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/S0012-365X(96)00358-5_BIB14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00358-5_BIB15","series-title":"Linear-time modular decomposition and efficient transitive orientation of comparability graphs","author":"McConnel","year":"1993"},{"key":"10.1016\/S0012-365X(96)00358-5_BIB16","first-page":"257","article-title":"Substitution decomposition and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00358-5_BIB17","series-title":"Graphs and Order","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"M\u00f6hring","year":"1985"},{"issue":"2","key":"10.1016\/S0012-365X(96)00358-5_BIB18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/jgt.3190120206","article-title":"On the strong perfect graph conjecture","volume":"12","author":"Olariu","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00358-5_BIB19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0020-0190(90)90143-L","article-title":"On the closure of triangle-free graphs under substitution","volume":"34","author":"Olariu","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(96)00358-5_BIB20","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01210984","article-title":"Graph derivates","volume":"76","author":"Sabidussi","year":"1961","journal-title":"Math. Z."},{"key":"10.1016\/S0012-365X(96)00358-5_BIB21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","article-title":"An upper bound on the chromatic number of a graph and its application to timetabling problems","volume":"10","author":"Welsh","year":"1967","journal-title":"Comput. J."},{"key":"10.1016\/S0012-365X(96)00358-5_BIB22","first-page":"47","article-title":"On a class of square-free graphs","volume":"57","author":"Xue","year":"1966","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003585?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003585?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:50:20Z","timestamp":1556131820000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96003585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0012365X96003585"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00358-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}