{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:10:55Z","timestamp":1758823855998},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":4855,"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":[[2000,4]]},"DOI":"10.1016\/s0012-365x(99)00240-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:02:29Z","timestamp":1027648949000},"page":"169-193","source":"Crossref","is-referenced-by-count":6,"title":["A class of \u03b2-perfect graphs"],"prefix":"10.1016","volume":"216","author":[{"given":"Celina M.Herrera","family":"de Figueiredo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristina","family":"Vu\u0161kovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)00240-X_BIB1","unstructured":"M. Conforti, G. Cornu\u00e9jols, A. Kapoor, K. Vu\u0161kovi\u0107, Even-hole-free graphs, Part I: decomposition theorem and Part II: recognition algorithm, preprint, 1997, J. Graph Theory, submitted for publication."},{"key":"10.1016\/S0012-365X(99)00240-X_BIB2","doi-asserted-by":"crossref","unstructured":"M. Conforti, G. Cornu\u00e9jols, A. Kapoor, K. Vu\u0161kovi\u0107, Finding an even hole in a graph, Proceedings of the 38th Annual Conference on Foundations of Computer Science, 1997, pp. 480\u2013485.","DOI":"10.1109\/SFCS.1997.646136"},{"key":"10.1016\/S0012-365X(99)00240-X_BIB3","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\/S0012-365X(99)00240-X_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.0030","article-title":"\u03b2-perfect graphs","volume":"67","author":"Markossian","year":"1996","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9900240X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9900240X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:54:06Z","timestamp":1555300446000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9900240X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0012365X9900240X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)00240-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}