{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:23Z","timestamp":1759063823079},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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,5]]},"DOI":"10.1016\/0166-218x(94)00162-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"219-226","source":"Crossref","is-referenced-by-count":9,"title":["On the complexity of recognizing a class of perfectly orderable graphs"],"prefix":"10.1016","volume":"66","author":[{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00162-7_BIB1","series-title":"Topics on Perfect Graphs","first-page":"63","article-title":"Perfectly ordered graphs","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0166-218X(94)00162-7_BIB2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","article-title":"Weakly triangulated graphs","volume":"B 39","author":"Hayward","year":"1985","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(94)00162-7_BIB3","unstructured":"R. Hayward, Personal communication (1990)."},{"key":"10.1016\/0166-218X(94)00162-7_BIB4","article-title":"The complexity of recognizing weakly triangulated graphs that are perfectly orderable","author":"Ho\u00e0ng","year":"1990"},{"key":"10.1016\/0166-218X(94)00162-7_BIB5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(89)90209-4","article-title":"Recognizing P4-comparability graphs","volume":"74","author":"Ho\u00e0ng","year":"1989","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/0166-218X(94)00162-7_BIB6","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/jgt.3190130407","article-title":"Some classes of perfectly orderable graphs","volume":"13","author":"Ho\u00e0ng","year":"1989","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/0166-218X(94)00162-7_BIB7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(90)90251-C","article-title":"On the complexity of recognizing perfectly orderable graphs","volume":"80","author":"Middendorf","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)00162-7_BIB8","series-title":"Proc. 10th Ann. ACM Symp. on Theory of Computing","first-page":"216","article-title":"The complexity of the satisfiabilty problem","author":"Schaefer","year":"1978"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001627?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001627?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T00:56:24Z","timestamp":1556153784000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94001627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0166218X94001627"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00162-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}