{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:05Z","timestamp":1759063505026},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"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":9543,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1016\/0095-8956(87)90045-1","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"264-273","source":"Crossref","is-referenced-by-count":22,"title":["Alternating orientation and alternating colouration of perfect graphs"],"prefix":"10.1016","volume":"42","author":[{"given":"C.T","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(87)90045-1_BIB1","first-page":"114","article-title":"F\u00e4rbung von Graphen deren samtliche bzw, ungerade Kreise starr sind (Zusammenfassung)","author":"Berge","year":"1961","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wintenberg, Math.-Naturwiss. Bibliothek Reihe"},{"key":"10.1016\/0095-8956(87)90045-1_BIB2","author":"Berge","year":"1984"},{"key":"10.1016\/0095-8956(87)90045-1_BIB3","series-title":"Topics on Perfect Graphs","article-title":"Strongly perfect graphs","author":"Berge","year":"1984"},{"key":"10.1016\/0095-8956(87)90045-1_BIB4","series-title":"Topics on Perfect Graphs","article-title":"Polynomial algorithm to recognize a Meyniel graph","author":"Burlet","year":"1984"},{"key":"10.1016\/0095-8956(87)90045-1_BIB5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(85)90049-8","article-title":"Star-cutset and perfect graphs","volume":"39","author":"Chv\u00e1tal","year":"1985","journal-title":"J. Combin. Theory. Ser. B"},{"key":"10.1016\/0095-8956(87)90045-1_BIB6","series-title":"Topics on Perfect Graphs","article-title":"Perfectly ordered graphs","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0095-8956(87)90045-1_BIB7","first-page":"145","article-title":"Aggregation of inequality in integer programming","volume":"Vol. 1","author":"Chv\u00e1tal","year":"1977"},{"key":"10.1016\/0095-8956(87)90045-1_BIB8","unstructured":"V. Chv\u00e1tal and N. Sbihi, Recognizing claw-free Berge graphs, J. Combin. Theory Ser. B, in press."},{"issue":"2","key":"10.1016\/0095-8956(87)90045-1_BIB9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math."},{"key":"10.1016\/0095-8956(87)90045-1_BIB10","first-page":"3","article-title":"Graphen mit triangulierbaren ungeraden Vielecken","volume":"7","author":"Gallai","year":"1962","journal-title":"Maggar Tud. Akad. Mat. Kutato Int. Kozl."},{"key":"10.1016\/0095-8956(87)90045-1_BIB11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbare graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Hungar."},{"key":"10.1016\/0095-8956(87)90045-1_BIB12","first-page":"1370","article-title":"Caract\u00e9risation des graphes non orient\u00e9s dont on peut orienter les arr\u00eates de mani\u00e8re a obtenir le graphe d'une relation d'ordre","volume":"254","author":"Ghouila-Houri","year":"1962","journal-title":"C. R. Acad. Sci. Paris Ser. I Math."},{"key":"10.1016\/0095-8956(87)90045-1_BIB13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","article-title":"Tolerance graphs","volume":"9","author":"Golumbic","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0095-8956(87)90045-1_BIB14","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","article-title":"Weakly triangulated graphs","volume":"39","author":"Hayward","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(87)90045-1_BIB15","unstructured":"R. Hayward, C. T. Ho\u00e0ng, and F. Maffray, \u201cOptimizing Weakly Triangulated Graphs,\u201d Rutgers University, Department of Computer Science, Technical Report, New Brunswick, N. J."},{"key":"10.1016\/0095-8956(87)90045-1_BIB16","doi-asserted-by":"crossref","unstructured":"C. T. Ho\u00e0ng, On a conjecture of Meyniel, J. Combin. Theory Ser. B 42, 302\u2013312.","DOI":"10.1016\/0095-8956(87)90047-5"},{"key":"10.1016\/0095-8956(87)90045-1_BIB17","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","article-title":"Uber graphen und ihre anwendung auf Determinanten-theorie und Mengenlenre","volume":"77","author":"K\u00f6nig","year":"1916","journal-title":"Math. Ann."},{"key":"10.1016\/0095-8956(87)90045-1_BIB18","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/S0012-365X(76)80008-8","article-title":"On the perfect graph conjecture","volume":"16","author":"Meyniel","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(87)90045-1_BIB19","unstructured":"H. Meyniel, \u201cA New Property of Critical Imperfect Graphs and Some Consequences,\u201d to appear."},{"key":"10.1016\/0095-8956(87)90045-1_BIB20","first-page":"115","article-title":"Uber die Uberdeckung von Graphen mit Cliquen","volume":"15","author":"Olaru","year":"1969","journal-title":"Wiss. Z. Tech. Hochsch. Ilmenau"},{"key":"10.1016\/0095-8956(87)90045-1_BIB21","series-title":"Topics on Perfect Graphs","article-title":"Contributions to a characterization of the structure of perfect graphs","author":"Olaru","year":"1984"},{"key":"10.1016\/0095-8956(87)90045-1_BIB22","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","article-title":"The strong perfect graph conjecture is true for K1,3-free graphs","volume":"21","author":"Parthasarath","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(87)90045-1_BIB23","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(82)90068-5","article-title":"Meyniel graphs are strongly perfect","volume":"33","author":"Ravindra","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(87)90045-1_BIB24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0095-8956(77)90064-8","article-title":"Critical perfect graphs and perfect 3-chromatic graphs","volume":"23","author":"Tucker","year":"1977","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895687900451?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895687900451?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T21:34:33Z","timestamp":1586036073000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895687900451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0095895687900451"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(87)90045-1","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}