{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T05:46:45Z","timestamp":1746078405132},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":7899,"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":[[1991,12]]},"DOI":"10.1016\/0012-365x(91)90373-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"161-174","source":"Crossref","is-referenced-by-count":2,"title":["New properties of perfectly orderable graphs and strongly perfect graphs"],"prefix":"10.1016","volume":"98","author":[{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Maffray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myriam","family":"Preissmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90373-A_BIB1","series-title":"Topics on perfect graphs","first-page":"57","article-title":"Strongly perfect graphs","author":"Berge","year":"1984"},{"key":"10.1016\/0012-365X(91)90373-A_BIB2","series-title":"Perfect graph seminar","author":"Chv\u00e1tal","year":"1983"},{"key":"10.1016\/0012-365X(91)90373-A_BIB3","series-title":"Topics on perfect graphs","first-page":"63","article-title":"Perfectly ordered graphs","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0012-365X(91)90373-A_BIB4","series-title":"Ph.D. Thesis","article-title":"Stability number in structured graphs","author":"Mahadev","year":"1984"},{"key":"10.1016\/0012-365X(91)90373-A_BIB5","series-title":"Research Report OR 89594","article-title":"On the complexity of recognizing perfectly orderable graphs","author":"Middendorf","year":"1989"},{"key":"10.1016\/0012-365X(91)90373-A_BIB6","series-title":"Technical Report","article-title":"Locally perfect graphs","author":"Preissmann","year":"1986"},{"key":"10.1016\/0012-365X(91)90373-A_BIB7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0012-365X(86)90097-X","article-title":"A note on super brittle graphs","volume":"61","author":"Preissmann","year":"1986","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190373A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190373A?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:24:39Z","timestamp":1555136679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190373A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0012365X9190373A"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90373-a","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}