{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:40:40Z","timestamp":1698043240973},"reference-count":7,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6243,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,9]]},"abstract":"Abstract<\/jats:title>In 1981, Chv\u00e1tal defined the class of perfectly orderable graphs. This class of perfect graphs contains the comparability graphs and the triangulated graphs. In this paper, we introduce four classes of perfectly orderable graphs, including natural generalizations of the comparability and triangulated graphs. We provide recognition algorithms for these four classes. We also discuss how to solve the clique, clique cover, coloring, and stable set problems for these classes.<\/jats:p>","DOI":"10.1002\/jgt.3190130407","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:25:23Z","timestamp":1180182323000},"page":"445-463","source":"Crossref","is-referenced-by-count":46,"title":["Some classes of perfectly orderable graphs"],"prefix":"10.1002","volume":"13","author":[{"given":"C. T.","family":"Ho\u00e0ng","sequence":"first","affiliation":[]},{"given":"B. A.","family":"Reed","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)72923-2"},{"key":"e_1_2_1_4_2","first-page":"1370","article-title":"Caract\u00e9risation des graphes non orient\u00e9s dont on peut orienter les ar\u011btes de mani\u00e8re \u00e0 obtenir le graphe d'une relation d'ordre","volume":"254","author":"Ghouila\u2010Houri A.","year":"1962","journal-title":"C.R. Acad. Sci. Paris"},{"key":"e_1_2_1_5_2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"1980"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"e_1_2_1_7_2","unstructured":"A.HertzandD.de Werra Les graphes bipolarisables. Report ORWP Swiss Federal Institute of Technology in Lausanne (1986)."},{"key":"e_1_2_1_8_2","article-title":"Recognizing P\n 4\u2010comparability graphs","author":"Ho\u00e1ng C. T.","journal-title":"Ann. Discrete Math."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T14:04:03Z","timestamp":1697983443000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["10.1002\/jgt.3190130407"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130407","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}